Largest Chordal and Interval Subgraphs Faster Than 2n

  • Ivan Bliznets
  • Fedor V. Fomin
  • Michał Pilipczuk
  • Yngve Villanger
Conference paper

DOI: 10.1007/978-3-642-40450-4_17

Volume 8125 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Bliznets I., Fomin F.V., Pilipczuk M., Villanger Y. (2013) Largest Chordal and Interval Subgraphs Faster Than 2n. In: Bodlaender H.L., Italiano G.F. (eds) Algorithms – ESA 2013. ESA 2013. Lecture Notes in Computer Science, vol 8125. Springer, Berlin, Heidelberg

Abstract

We prove that in an n-vertex graph, induced chordal and interval subgraphs with the maximum number of vertices can be found in time \(\mathcal{O}(2^{\lambda n})\) for some λ < 1. These are the first algorithms breaking the trivial 2nnO(1) bound of the brute-force search for these problems.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Ivan Bliznets
    • 1
  • Fedor V. Fomin
    • 2
  • Michał Pilipczuk
    • 2
  • Yngve Villanger
    • 2
  1. 1.St. Petersburg Academic University of the Russian Academy of SciencesRussia
  2. 2.Department of InformaticsUniversity of BergenNorway