A note on the independence number, domination number and related parameters of random binary search trees and random recursive trees

[1]  Kenneth Dadedzi.  Analysis of tree spectra , 2018 .

[2]  Ness B. Shroff,et al.  Distributed Greedy Approximation to Maximum Weighted Independent Set for Scheduling With Fading Channels , 2013, IEEE/ACM Transactions on Networking.

[3]  Fabrizio Grandoni.  Exact Algorithms for Maximum Independent Set , 2016, Encyclopedia of Algorithms.

[4]  Svante Janson,et al.  Limit laws for functions of fringe trees for binary search trees and random recursive trees , 2015 .

[5]  Daniel Lokshtanov,et al.  Independent Set in P5-Free Graphs in Polynomial Time , 2014, SODA.

[6]  Hiroshi Nagamochi,et al.  Exact Algorithms for Maximum Independent Set , 2013, ISAAC.

[7]  Hiroshi Nagamochi,et al.  Confining sets and avoiding bottleneck cases: A simple maximum independent set algorithm in degree-3 graphs , 2013, Theor. Comput. Sci..

[8]  J. Jost,et al.  Minimum Vertex Covers and the Spectrum of the Normalized Laplacian on Trees , 2010, 1010.4269.

[9]  Derrick Kondo,et al.  A maximum independent set approach for collusion detection in voting pools , 2011, J. Parallel Distributed Comput..

[10]  A. Bonato,et al.  Dominating Biological Networks , 2011, PloS one.

[11]  Fabrizio Grandoni,et al.  A measure & conquer approach for the analysis of exact algorithms , 2009, JACM.

[12]  Colin Cooper,et al.  An analysis of the size of the minimum dominating sets in random recursive trees, using the Cockayne-Goodman-Hedetniemi algorithm , 2009, Discret. Appl. Math..

[13]  Thomas C. van Dijk,et al.  Inclusion/Exclusion Meets Measure and Conquer Exact Algorithms for Counting Dominating Sets , 2009 .

[14]  David Zuckerman,et al.  Electronic Colloquium on Computational Complexity, Report No. 100 (2005) Linear Degree Extractors and the Inapproximability of MAX CLIQUE and CHROMATIC NUMBER , 2005 .

[15]  Vangelis Th. Paschos,et al.  Completeness in standard and differential approximation classes: Poly-(D)APX- and (D)PTAS-completeness , 2005, Theor. Comput. Sci..

[16]  Martin Grohe.  Local Tree-Width, Excluded Minors, and Approximation Algorithms , 2000, Comb..

[17]  Hsien-Kuei Hwang,et al.  Phase Change of Limit Laws in the Quicksort Recurrence under Varying Toll Functions , 2002, SIAM J. Comput..

[18]  Panos M. Pardalos,et al.  Finding maximum independent sets in graphs arising from coding theory , 2002, SAC '02.

[19]  Luc Devroye,et al.  Limit Laws for Sums of Functions of Subtrees of Random Binary Search Trees , 2002, SIAM J. Comput..

[20]  Mahtab Seddigh,et al.  Dominating Sets and Neighbor Elimination-Based Broadcasting Algorithms in Wireless Networks , 2002, IEEE Trans. Parallel Distributed Syst..

[21]  Michael A. Henning,et al.  Domination in graphs , 1998 .

[22]  Ran Raz,et al.  A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP , 1997, STOC '97.

[23]  Stephen T. Hedetniemi,et al.  Bibliography on domination in graphs and some basic definitions of domination parameters , 1991, Discret. Math..

[24]  L. Lovász,et al.  Geometric Algorithms and Combinatorial Optimization , 1988, Algorithms and Combinatorics.

[25]  John Michael Robson,et al.  Algorithms for Maximum Independent Sets , 1986, J. Algorithms.

[26]  M. Jacobson,et al.  n-Domination in graphs , 1985 .

[27]  Brenda S. Baker,et al.  Approximation algorithms for NP-complete problems on planar graphs , 1983, 24th Annual Symposium on Foundations of Computer Science (sfcs 1983).

[28]  Nobuji Saito,et al.  Linear-time computability of combinatorial problems on series-parallel graphs , 1982, JACM.

[29]  Béla Bollobás,et al.  The independence ratio of regular graphs , 1981 .

[30]  George J. Minty,et al.  On maximal independent sets of vertices in claw-free graphs , 1980, J. Comb. Theory B.

[31]  Stephen T. Hedetniemi,et al.  A Linear Algorithm for the Domination Number of a Tree , 1975, Inf. Process. Lett..

[32]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[33]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .