All maximal independent sets and dynamic dominance for sparse graphs

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 451-459

  Eppstein, David ^a  

^a Irvine   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOUNDED DEGREE GRAPHS; ENUMERATION ALGORITHMS; MAXIMAL INDEPENDENT SET ALGORITHMS; SPARSE GRAPHS;

ALGORITHMS; COMPUTATIONAL COMPLEXITY; DATA STRUCTURES; EQUIVALENCE CLASSES; POLYNOMIALS; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

GRAPH THEORY;

EID: 20744443794     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. D. Avis and K. Fukuda. A pivoting algorithm for convex hulls and vertex enumeration of arrangements and polyhedra. Discrete Comput. Geom. 8(3):295-313, 1992.
2. D. Avis and K. Fukuda. Reverse search for enumeration. Discrete Appl. Math. 65:21-46, 1996.
3. I. M. Bomze, M. Budinich, P. M. Pardalos, and M. Pelillo. The maximum clique problem. Handbook of Combinatorial Optimization, vol. 4, pp. 1-74. Kluwer Academic Publishers, 1999.
4. J. M. Byskov. Algorithms for k-colouring and finding maximal independent sets. Proc. 14th Symp. Discrete Algorithms, pp. 456-457. ACM and SIAM, 2003.
5. N. Chiba and T. Nishizeki. Arboricity and subgraph listing algorithms. SIAM J. Comput. 14:210-223, 1985.
6. M. Chrobak and D. Eppstein. Planar orientations with low out-degree and compaction of adjacency matrices. Theor. Comput. Sci. 86(2):243-266, 1991.
7. D. Eppstein. Finding the k shortest paths. SIAM J. Computing 28(2):652-673, 1998.
8. D. Eppstein. Small maximal independent sets and faster exact graph coloring. J. Graph Algorithms & Applications 7(2):131-140, 2003, arXiv:cs.DS/0011009.
9. E. Jennings and L. Motycková. A distributed algorithm for finding all maximal cliques in a network graph. Proc. 1st Latin Amer. Symp. Theoretical Informatics (LATIN '92), pp. 281-293. Springer-Verlag, Lecture Notes in Computer Science 583, 1992.
10. D. S. Johnson, M. Yannakakis, and C. H. Papadimitriou. On generating all maximal independent sets. Inform. Proc. Lett. 27(3):119-123, 1988.
11. E. Lawler, J. K. Lenstra, and A. H. G. Rinnooy Kan. Generating all maximal independent sets: NP-hardness and polynomial-time algorithms. SIAM J. Comput. 9(3):558-565, 1980.
12. J. Y.-T. Leung. Fast algorithms for generating all maximal independent sets of interval, circular-arc and chordal graphs. J. Algorithms 5:22-35, 1984.
13. Y. D. Liang, S. K. Dhall, and S. Lakshmivarahan. On the problem of finding all maximum weight independent sets in interval and circular-arc graphs. Proc. Symp. Applied Computing, pp. 465-470. IEEE, 1991.
14. W. Mader. Homomorphieeigenschaften und mittlere Kantendichte von Graphen. Math. Ann. 174:265-268, 1967.
15. K. Makino and T. Uno. New algorithms for enumerating all maximal cliques. Proc. 9th Scand. Worksh. Algorithm Theory (SWAT 2004), pp. 260-272. Springer-Verlag, Lecture Notes in Computer Science 3111, 2004.
16. D. Matula and L. Beck. Smallest-last ordering and clustering and graph coloring algorithms. J. ACM 30:417-427, 1983.
17. N. Mishra and L. Pitt. Generating all maximal independent sets of bounded-degree hypergraphs. Proc. 10th Conf. Computational Learning Theory (COLT '97), pp. 211-217. ACM, 1997.
18. V. Stix. Finding all maximal cliques in dynamic graphs. Computational Optimization Appl. 27(2):173-186, 2004.
19. G. Szekeres and H. Wilf. An inequality for the chromatic number of a graph. J. Comb. Th. 4:1-3, 1968.
20. E. Tomita, A. Tanaka, and H. Takahashi. The worst-case time complexity for generating all maximal cliques. Proc. 10th Int. Computing and Combinatorics Conf. (COCOON 2004), 2004.
21. S. Tsukiyama, M. Ide, H. Ariyoshi, and I. Shirakawa. A new algorithm for generating all the maximal independent sets. SIAM J. Comput. 6(3):505-517, 1977.
22. C.-W. Yu and G.-H. Chen. Generate all maximal independent sets in permutation graphs. Internat. J. Comput. Math. 47:1-8, 1993.