Fast exponential algorithms for maximum r-regular induced subgraph problems

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4337 LNCS, Issue , 2006, Pages 139-151

  Gupta, Sushmita ^a   Raman, Venkatesh ^b   Saurabh, Saket ^b  

^a SIMON FRASER UNIVERSITY   (Canada)

^b INSTITUTE OF MATHEMATICAL SCIENCES   (India)

Author keywords

[No Author keywords available]

Indexed keywords

SOFTWARE ENGINEERING;

ENUMERATION ALGORITHMS; EXACT ALGORITHMS; EXPONENTIAL ALGORITHMS; INDUCED SUBGRAPHS; POSITIVE CONSTANT; REGULAR INDUCED SUBGRAPH; SUBGRAPH ISOMORPHISM; TECHNIQUES AND RESULTS;

GRAPH THEORY;

EID: 85000515017     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11944836_15     Document Type: Conference Paper

References (18)

1. L. BABAI, W.M.KANTOR AND E. M. LUKS. Computational Complexity and the Classification of Finite Simple Groups. In the Proceedings of FOCS’83. 162-171 (1983).
2. AURA. On the Complexity of Uniformly Mixed Nash Equilibria and Related Regular Subgraph Problems. In the Proceedings of FCT’05. LNCS 3623: 197-208 (2005).
3. J. M. BYSKOV. Enumerating Maximal Independent Sets with Applications to Graph Colouring. Operations Research Letters 32(6): 547-556 (2004).
4. K. CAMERON. Induced Matchings. Discrete Applied Mathematics 24: 97-102 (1989).
5. OZIN. Maximum k-Regular Induced Subgraphs. Rutcor Research Report (RRR) 3, (2006).
6. n). In the Proceedings of IWPEC’06. LNCS 4169: 184-191 (2006).
7. 0.288n) Independent Set Algorithm. In the Proceedings of SODA’06: 18-25(2006).
8. RATSCH. Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the EATCS 87: 47-77 (2005).
9. M. R. GAREY AND D. S. JOHNSON. Computer and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman, San Francisco, CA., (1979).
10. J. P. GEORGES, M. D.HALSEY, A. M. SANAULLA, M. A. WHITTLESEY. Edge Domination and Graph Structure. Cong. Numer. 76: 127-144 (1990).
11. UKS. Isomorphism of Graphs of Bounded Valence can be Tested in Polynomial Time. Journal of Computer System Sciences 25(1): 42-65 (1982).
12. OSER. On Cliques in Graphs. Israel Journal of Mathematics 3: 23-28 (1965).
13. V. RAMAN, S. SAURABH AND S. SIKDAR Efficient Exact Algorithms through Enumerating Maximal Independent Sets and Other Techniques. To appear in Theory of Computing Systems.
14. I. RAZGON. Exact Computation of Maximum Induced Forest. In the Proceedings of SWAT’06. LNCS 4059: 160-171 (2006).
15. J. M. ROBSON. Algorithms for Maximum Independent Set. Journal of Algorithms 7: 425 -440 (1986).
16. A. STEGER AND M. YU. On Induced Matchings. Discrete Mathematics 120: 291-295 (1993).
17. L. J. STOCKMEYER AND V. V. VAZIRANI. NP-Completeness of Some Generalizations of the Maximum Matching Problem. Information Processing Letters 15(1): 14-19 (1982).
18. OEGINGER. Exact algorithms for NP-hard problems: A survey. In Combinatorial Optimization—Eureka! You shrink!. LNCS 2570: 185-207 (2003).