The following pages link to Safe separators for treewidth (Q819825):
Displaying 35 items.
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- Peptide sequencing via graph path decomposition (Q528747) (← links)
- Space-optimal, backtracking algorithms to list the minimal vertex separators of a graph (Q602684) (← links)
- Strongly chordal and chordal bipartite graphs are sandwich monotone (Q652637) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Safe separators for treewidth (Q819825) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- On the maximum cardinality search lower bound for treewidth (Q997060) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- An introduction to clique minimal separator decomposition (Q1662549) (← links)
- Towards fixed-parameter tractable algorithms for abstract argumentation (Q1761281) (← links)
- Near-optimal lower bounds on regular resolution refutations of Tseitin formulas for all constant-degree graphs (Q1983330) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Characterizing Tseitin-formulas with short regular resolution refutations (Q2118291) (← links)
- Bounded treewidth as a key to tractability of knowledge representation and reasoning (Q2269134) (← links)
- On sparsification for computing treewidth (Q2343087) (← links)
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- Positive-instance driven dynamic programming for treewidth (Q2424727) (← links)
- Tree decomposition and discrete optimization problems: a survey (Q2480502) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- BWM*: A Novel, Provable, Ensemble-Based Dynamic Programming Algorithm for Sparse Approximations of Computational Protein Design (Q2814583) (← links)
- Preprocessing for Treewidth: A Combinatorial Analysis through Kernelization (Q3012824) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- Revisiting Decomposition by Clique Separators (Q4610181) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)
- Fully Polynomial FPT Algorithms for Some Classes of Bounded Clique-width Graphs (Q4972678) (← links)
- Positive-Instance Driven Dynamic Programming for Treewidth. (Q5111757) (← links)
- Computing treewidth on the GPU (Q5111889) (← links)
- Strongly Chordal and Chordal Bipartite Graphs Are Sandwich Monotone (Q5323088) (← links)
- Tractable answer-set programming with weight constraints: bounded treewidth is not enough (Q5410728) (← links)
- Characterizing Tseitin-Formulas with Short Regular Resolution Refutations (Q5881799) (← links)
- Faster and enhanced inclusion-minimal cograph completion (Q5915859) (← links)
- Induced subgraphs and tree decompositions. VII: Basic obstructions in \(H\)-free graphs (Q6144407) (← links)
- Induced subgraphs and tree decompositions V. one neighbor in a hole (Q6199380) (← links)
