• DOI:10.4230/LIPIcs.STACS.2010.2470
Corpus ID: 436224

Finding Induced Subgraphs via Minimal Triangulations

@inproceedings{Fomin2010FindingIS,
  title={Finding Induced Subgraphs via Minimal Triangulations},
  author={F. Fomin and Yngve Villanger},
  booktitle={STACS},
  year={2010}
}

F. Fomin, Yngve Villanger

Published in STACS 2010

Mathematics, Computer Science

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… CONTINUE READING

View PDF on arXiv

Save to Library

Create Alert

Cite

Launch Research Feed