Years and Authors of Summarized Original Work
2010; Fomin, Villanger
2013; Bliznets, Fomin, Pilipczuk, Villanger
Problem Definition
A graph class Î is a set of simple graphs. One can also think of Î as a property: Î comprises all the graphs that satisfy a certain condition. We say that class (property) Î is hereditary if it is closed under taking induced subgraphs. More precisely, whenever G â Î and H is an induced subgraph of G, then also H â Î .
We shall consider the MAXIMUM INDUCED Î -SUBGRAPH problem: given a graph G, find the largest (in terms of the number of vertices) induced subgraph of G that belongs to Î . Suppose now that class Î is polynomial-time recognizable: there exists an algorithm that decides whether a given graph H belongs to Î in polynomial time. Then MAXIMUM INDUCED Î -SUBGRAPH on an n-vertex graph G can be solved by brute force in time (The \(\mathcal{O}^{\star }(\cdot )\) notation hides factors polynomial in the input size.) \(\mathcal{O}^{\star }(2^{n})\): we...
Recommended Reading
Bliznets I, Fomin FV, Pilipczuk M, Villanger Y (2013) Largest chordal and interval subgraphs faster than 2n. In: Bodlaender HL, Italiano GF (eds) ESA, Sophia Antipolis. Lecture Notes in Computer Science, vol 8125. Springer, pp 193â204
Fomin FV, Villanger Y (2010) Finding induced subgraphs via minimal triangulations. In: Marion JY, Schwentick T (eds) STACS, Nancy. LIPIcs, vol 5. Schloss Dagstuhl â Leibniz-Zentrum fuer Informatik, pp 383â394
Fomin FV, Gaspers S, Kratsch D, Liedloff M, Saurabh S (2010) Iterative compression and exact algorithms. Theor Comput Sci 411(7â9):1045â1053
Fomin FV, Todinca I, Villanger Y (2011) Exact algorithm for the maximum induced planar subgraph problem. In: Demetrescu C, HalldĂłrsson MM (eds) ESA, SaarbrĂŒcken. Lecture notes in computer science, vol 6942. Springer, pp 287â298
Fomin FV, Todinca I, Villanger Y (2014) Large induced subgraphs via triangulations and CMSO. In: Chekuri C (ed) SODA, Portland. SIAM, pp 582â583
Gaspers S, Kratsch D, Liedloff M (2012) On independent sets and bicliques in graphs. Algorithmica 62(3â4):637â658
Gupta S, Raman V, Saurabh S (2012) Maximum r-regular induced subgraph problem: fast exponential algorithms and combinatorial bounds. SIAM J Discr Math 26(4):1758â1780
Pilipczuk M, Pilipczuk M (2012) Finding a maximum induced degenerate subgraph faster than 2n. In: Thilikos DM, Woeginger GJ (eds) IPEC, Ljubljana. Lecture notes in computer science, vol 7535. Springer, pp 3â12
Raman V, Saurabh S, Sikdar S (2007) Efficient exact algorithms through enumerating maximal independent sets and other techniques. Theory Comput Syst 41(3):563â587
Robson JM (1986) Algorithms for maximum independent sets. J Algorithms 7(3):425â440
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer Science+Business Media New York
About this entry
Cite this entry
Pilipczuk, M. (2015). Exact Algorithms for Induced Subgraph Problems. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, Boston, MA. https://doi.org/10.1007/978-3-642-27848-8_520-1
Download citation
DOI: https://doi.org/10.1007/978-3-642-27848-8_520-1
Received:
Accepted:
Published:
Publisher Name: Springer, Boston, MA
Online ISBN: 978-3-642-27848-8
eBook Packages: Springer Reference Computer SciencesReference Module Computer Science and Engineering