Finding Induced Subgraphs via Minimal Triangulations

Fomin, Fedor V.; Villanger, Yngve

doi:10.4230/LIPIcs.STACS.2010.2470

Document

Finding Induced Subgraphs via Minimal Triangulations

Authors Fedor V. Fomin, Yngve Villanger

Part of: Volume: 27th International Symposium on Theoretical Aspects of Computer Science (STACS 2010)
Part of: Series: Leibniz International Proceedings in Informatics (LIPIcs)
Part of: Conference: Symposium on Theoretical Aspects of Computer Science (STACS)
License: Creative Commons Attribution-NoDerivs 3.0 Unported license
Publication Date: 2010-03-09

PDF

File

PDF

LIPIcs.STACS.2010.2470.pdf

Filesize: 305 kB
12 pages

Document Identifiers

DOI: 10.4230/LIPIcs.STACS.2010.2470
URN: urn:nbn:de:0030-drops-24708

Subject Classification

Keywords

Bounded treewidth
minimal triangulation
moderately exponential time algorithms

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

Abstract

Potential maximal cliques and minimal separators are combinatorial objects which were introduced and studied in the realm of  minimal triangulation problems including Minimum Fill-in and Treewidth. We discover unexpected applications of these notions to the field of moderate exponential algorithms. In particular, we show that given an n-vertex graph G together with its set of potential maximal cliques, and an integer t, it is possible in time the number of potential maximal cliques times $O(n^{O(t)})$ to find a maximum induced subgraph of treewidth t in G and for a given graph F of treewidth t, to decide if G contains an induced subgraph isomorphic to F.
Combined with an improved algorithm enumerating all potential maximal cliques in time $O(1.734601^n)$, this yields that both the problems are solvable in time  $1.734601^n$ * $n^{O(t)}$.

Cite As Get BibTex

Fedor V. Fomin and Yngve Villanger. Finding Induced Subgraphs via Minimal Triangulations. In 27th International Symposium on Theoretical Aspects of Computer Science. Leibniz International Proceedings in Informatics (LIPIcs), Volume 5, pp. 383-394, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010) https://doi.org/10.4230/LIPIcs.STACS.2010.2470

Author Details

Fedor V. Fomin

Yngve Villanger

Any Issues?

Feedback on the Current Page

Thanks for your feedback!

Feedback submitted to Dagstuhl Publishing

Could not send message

Please try again later or send an E-mail