Finding induced subgraphs via minimal triangulations

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 5, Issue , 2010, Pages 383-394

  Fomin, Fedor V ^a   Villanger, Yngve ^a  

^a UNIVERSITY OF BERGEN   (Norway)

Author keywords

Bounded treewidth; Minimal triangulation; Moderately exponential time algorithms

Indexed keywords

BOUNDED TREEWIDTH; COMBINATORIAL OBJECTS; EXPONENTIAL ALGORITHMS; INDUCED SUBGRAPHS; MAXIMAL CLIQUE; MINIMAL TRIANGULATIONS; MODERATELY EXPONENTIAL TIME ALGORITHMS; N-VERTEX GRAPH;

ALGORITHMS; COMPUTER SCIENCE; TRIANGULATION;

GRAPH THEORY;

EID: 84880314592     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.4230/LIPIcs.STACS.2010.2470     Document Type: Conference Paper

References (25)

1. N. ALON, P. SEYMOUR, AND R. THOMAS, A separator theorem for nonplanar graphs, J. Amer. Math. Soc, 3 (1990), pp. 801-808.
2. S. ARNBORG, D. G. CORNEIL, AND A. PROSKUROWSKI, Complexity of finding embedding s in a k-tree, SIAM J. Algebraic Discrete Methods, 8 (1987), pp. 277-284.
3. A. BERRY, J. P. BORDAT, AND O. COGIS, Generating all the minimal separators of a graph, Int. J. Found. Comput. Sci., 11 (2000), pp. 397-403.
4. H. L. BODLAENDER, Polynomial algorithms for graph isomorphism and chromatic index on partial k-trees, J. Algorithms, 11 (1990), pp. 631-643.
5. V. BOUCHITTÉ AND I. TODINCA, Treewidth and minimum fill-in: Grouping the minimal separators, SIAM J. Comput., 31 (2001), pp. 212-232.
6. -, Listing all potential maximal cliques of a graph, Theor. Comput. Sci., 276 (2002), pp. 17-32.
7. J. CHEN, I. A. KANJ, AND G. XIA, Labeled search trees and amortized analysis: improved upper bounds for NP-hard problems, Algorithmica, 43 (2005), pp. 245-273.
8. M. DAVIS AND H. PUTNAM, A computing procedure for quantification theory, J. Assoc. Comput. Mach., 7 (1960), pp. 201-215.
9. F. V. FOMIN, S. GASPERS, AND A. V. PYATKIN, Finding a minimum feedback vertex set in time O(1.7548n), in Proceedings of the 2nd International Workshop on Parameterized and Exact Computation (IWPEC 2006), vol. 4169 of Lecture Notes in Comput. Sci., Springer, Berlin, 2006, pp. 184-191.
10. F. V. FOMIN, S. GASPERS, A. V. PYATKIN, AND I. RAZGON, On the minimum feedback vertex set problem: Exact and enumeration algorithms, Algorithmica, 52 (2008), pp. 293-307.
11. 0.288n) independent set algorithm, in 17th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA 2006), New York, 2006, ACM and SIAM, pp. 18-25.
12. F. V. FOMIN, D. KRATSCH, I. TODINCA, AND Y. VILLANGER, Exact algorithms for treewidth and minimum fill-in, SIAM J. Comput., 38 (2008), pp. 1058-1079.
13. F. V. FOMIN AND Y. VILLANGER, Treewidth computation and extremal combinatorics, in Proceedings of the 34th International Colloquium on Automata, Languages and Programming (ICALP 2008), LNCS, Springer, 2008, pp. 210-221.
14. M. FÜRER, A faster algorithm for finding maximum independent sets in sparse graphs, in Proceedings of the 7th Latin American Theoretical Informatics Symposium (LATIN 2006), vol. 3887 of Lecture Notes in Comput. Sci., Springer-Verlag, Berlin, 2006, pp. 491-501.
15. S. GUPTA, V. RAMAN, AND S. SAURABH, Fast exponential algorithms for maximum r-regular induced subgraph problems, in Proceedings of the 26th International Conference Foundations of Software Technology and Theoretical Computer Science, (FSTTCS 2006), LNCS, Springer-Verlag, 2006, pp. 139-151.
16. P. HEGGERNES, Minimal triangulations of graphs: A survey, Discrete Mathematics, 306 (2006), pp. 297-317.
17. 0.304n) algorithm for solving maximum independent set problem, IEEE Trans. Computers, 35 (1986), pp. 847-851.
18. R. E. MILLER AND D. E. MULLER, A problem of maximum consistent subsets, IBM Research Rep. RC-240, J.T. Watson Research Center, Yorktown Heights, New York, USA, 1960.
19. J. W. MOON AND L. MOSER, On cliques in graphs, Israel Journal of Mathematics, 3 (1965), pp. 23-28.
20. I. RAZGON, Exact computation of maximum induced forest, in Proceedings of the 10th Scandinavian Workshop on Algorithm Theory (SWAT 2006), vol. 4059 of Lecture Notes in Comput. Sci., Berlin, 2006, Springer, pp. 160-171.
21. -, A faster solving of the maximum independent set problem for graphs with maximal degree 3, in Proceedings of the Second ACiD Workshop (ACiD 2006), vol. 7 of Texts in Algorithmics, King's College, London, 2006, pp. 131-142.
22. N. ROBERTSON AND P. D. SEYMOUR, Graph minors. II. Algorithmic aspects of tree-width, Journal of Algorithms, 7 (1986), pp. 309-322.
23. J. M. ROBSON, Algorithms for maximum independent sets, Journal of Algorithms, 7 (1986), pp. 425-440.
24. D. J. ROSE, R. E. TARJAN, AND G. S. LUEKER, Algorithmic aspects of vertex elimination on graphs, SIAM J. Comput., 5 (1976), pp. 266-283.
25. R. E. TARJAN AND A. E. TROJANOWSKI, Finding a maximum independent set, SIAM Journal on Computing, 6 (1977), pp. 537-546.