Finding Induced Subgraphs via Minimal Triangulations

  title={Finding Induced Subgraphs via Minimal Triangulations},
  author={F. Fomin and Yngve Villanger},
  • 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
    91 Citations
    Large induced subgraphs via triangulations and CMSO
    • 6
    Finding a Maximum Induced Degenerate Subgraph Faster Than 2 n
    • 21
    • PDF
    Induced subgraphs of bounded treewidth and the container method
    • 10
    • Highly Influenced
    • PDF
    Large Induced Subgraphs via Triangulations and CMSO
    • 58
    • PDF
    Minimal separators in graph classes defined by small forbidden induced subgraphs
    • 3
    • PDF
    Enumeration and Maximum Number of Minimal Connected Vertex Covers in Graphs
    • 7
    • PDF


    Treewidth and Minimum Fill-in: Grouping the Minimal Separators
    • 182
    • PDF
    Fast Exponential Algorithms for Maximum r-Regular Induced Subgraph Problems
    • 22
    • PDF
    Listing all potential maximal cliques of a graph
    • 111
    • PDF
    Exact Algorithms for Treewidth and Minimum Fill-In
    • 82
    • PDF
    Finding maximum independent sets in sparse and general graphs
    • R. Beigel
    • Mathematics, Computer Science
    • SODA '99
    • 1999
    • 120
    Minimal triangulations of graphs: A survey
    • 169
    • PDF
    Treewidth computation and extremal combinatorics
    • 49
    • PDF
    Algorithmic Aspects of Vertex Elimination on Graphs
    • 1,167
    • PDF
    Complexity of finding embeddings in a k -tree
    • 1,280
    A separator theorem for nonplanar graphs
    • 199
    • PDF