1 research outputs found
Largest chordal and interval subgraphs faster than 2^n
We prove that in an n-vertex graph, induced chordal and interval subgraphs
with the maximum number of vertices can be found in time for
some . These are the first algorithms breaking the trivial bound of the brute-force search for these problems.Comment: The preliminary version of this work appeared in the proceedings of
ESA 201