Pages that link to "Item:Q2784449"
From MaRDI portal
The following pages link to Treewidth and Minimum Fill-in: Grouping the Minimal Separators (Q2784449):
Displayed 50 items.
- Approximately counting locally-optimal structures (Q295655) (← links)
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Computing hypergraph width measures exactly (Q437685) (← 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)
- Beyond classes of graphs with ``few'' minimal separators: FPT results through potential maximal cliques (Q666659) (← links)
- Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Approximation algorithms for treewidth (Q848843) (← links)
- Treewidth lower bounds with brambles (Q926284) (← links)
- Minimal split completions (Q967310) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- On the complexity of computing treelength (Q972342) (← links)
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions (Q1001894) (← links)
- On a property of minimal triangulations (Q1024493) (← links)
- Approximating the treewidth of AT-free graphs. (Q1408810) (← links)
- Chordal embeddings of planar graphs (Q1417569) (← links)
- On treewidth approximations. (Q1427177) (← links)
- Excluding hooks and their complements (Q1671647) (← links)
- Algorithms parameterized by vertex cover and modular width, through potential maximal cliques (Q1751087) (← links)
- Minimal separators in extended \(P_4\)-laden graphs (Q1759855) (← links)
- Graphical models for genetic analyses (Q1764318) (← links)
- Tree decompositions with small cost (Q1764801) (← links)
- Computing the branchwidth of interval graphs (Q1764810) (← links)
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors (Q1880778) (← links)
- Approximation of knapsack problems with conflict and forcing graphs (Q2012887) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- Finding optimal triangulations parameterized by edge clique cover (Q2161006) (← links)
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- Covering minimal separators and potential maximal cliques in \(P_t\)-free graphs (Q2227825) (← links)
- Finding small-width connected path decompositions in polynomial time (Q2328867) (← links)
- On the maximum weight minimal separator (Q2333804) (← links)
- Treewidth computation and extremal combinatorics (Q2392037) (← links)
- Positive-instance driven dynamic programming for treewidth (Q2424727) (← links)
- A revisit of the scheme for computing treewidth and minimum fill-in (Q2441783) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability (Q2661784) (← links)
- Graphs with polynomially many minimal separators (Q2664556) (← links)
- On the Number of Minimal Separators in Graphs (Q2827806) (← links)
- Beyond Classes of Graphs with “Few” Minimal Separators: FPT Results Through Potential Maximal Cliques (Q2827832) (← links)
- Fixed-Parameter Tractability of Treewidth and Pathwidth (Q2908539) (← links)
- Large Induced Subgraphs via Triangulations and CMSO (Q2954371) (← links)
- On the Maximum Weight Minimal Separator (Q2988830) (← links)
- On Distance-d Independent Set and Other Problems in Graphs with “few” Minimal Separators (Q3181057) (← links)
- Constructing Brambles (Q3182927) (← links)
- Approximately Counting Locally-Optimal Structures (Q3448823) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- A Characterisation of the Minimal Triangulations of Permutation Graphs (Q3508558) (← links)
- Solving Graph Problems via Potential Maximal Cliques (Q4629543) (← links)