Exact computation of maximum induced forest

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

Volumn 4059 LNCS, Issue , 2006, Pages 160-171

  Razgon, Igor ^a  

^a UNIVERSITY COLLEGE CORK   (Ireland)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; GRAPH THEORY; OPERATIONS RESEARCH; OPTIMIZATION; PROBLEM SOLVING; TREES (MATHEMATICS);

BACKTRACK ALGORITHM; FEEDBACK VERTEX SET (FVS); INTRACTABLE PROBLEM; MAXIMUM INDUCED FOREST PROBLEM (MIF);

COMPUTATIONAL METHODS;

EID: 33746423975     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11785293_17     Document Type: Conference Paper

References (10)

1. J. Byskov. Enumerating maximal independent sets with applications to graph colouring. Operations Research Letters, 32(6):547-556, November 2004.
2. E. Dantsin, A. Goerdt, E. Hirsch, R. Kannan, J. Kleinberg, C. Papadimitriou, P. Raghavan, and U. Scheming. A deterministic (2-2/(k+1)) n algorithm for k-sat based on local search. Theor. Comput. Sci., 289(1):69-83, 2002.
3. D. Eppstein. Improved algorithms for 3-coloring, 3-edge coloring and constraint satisfaction. In SODA-2001, pages 329-337, 2001.
4. F. Fomin, F. Grandoni, and D. Kratsch. Measure and conquer: Domination - a case study. In ICALP, pages 191-203, 2005.
5. F. Fomin, F. Grandoni, and D. Kratsch. Some new techniques in design and analysis of exact (exponential) algorithms. Bulletin of the EATCS, 87:47-77, 2005.
6. F. Fomin and A. Pyatkin. Finding minimum feedback vertex set in bipartite graphs. In Report N 291, Department of Informatics, University of Bergen, 2005.
7. R. Karp. Reducibility among combinatorial problems. In Complexity of Computer Computations, 1972.
8. V. Raman, S. Saurabh, and S. Sikdar. Improved exact exponential algorithms for vertex bipartization and other problems. In ICTCS, pages 375-389, 2005.
9. J. Robson. Algorithms for maximum independent sets. Journal of Algorithms, 7:425-440, 1986.
10. G. Woeginger. Exact algorithms for NP-hard problems: A survey. In Combinatorial Optimization: "Eureka, you shrink", LNCS 2570, pages 185-207, 2003.