Pages that link to "Item:Q1372739"
From MaRDI portal
The following pages link to Characterizations and algorithmic applications of chordal graph embeddings (Q1372739):
Displaying 50 items.
- Two characterisations of the minimal triangulations of permutation graphs (Q390311) (← links)
- Organizing the atoms of the clique separator decomposition into an atom tree (Q406311) (← links)
- Separator orders in interval, cocomparability, and AT-free graphs (Q534331) (← links)
- Fast minimal triangulation algorithm using minimum degree criterion (Q551209) (← links)
- Faster parameterized algorithms for \textsc{Minimum Fill-in} (Q652537) (← links)
- Treewidth and minimum fill-in on permutation graphs in linear time (Q708222) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Listing all the minimal separators of a 3-connected planar graph (Q819830) (← links)
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs (Q856888) (← links)
- Connected graph searching in chordal graphs (Q967304) (← links)
- Minimal split completions (Q967310) (← links)
- Computing branchwidth via efficient triangulations and blocks (Q967315) (← links)
- Boxicity and cubicity of asteroidal triple free graphs (Q968429) (← links)
- Dynamic programming and planarity: improved tree-decomposition based algorithms (Q972340) (← 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)
- Induced matchings in asteroidal triple-free graphs (Q1414582) (← links)
- Chordal embeddings of planar graphs (Q1417569) (← links)
- On treewidth approximations. (Q1427177) (← links)
- Listing all potential maximal cliques of a graph (Q1605302) (← links)
- On claw-free asteroidal triple-free graphs (Q1613398) (← links)
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs (Q1763474) (← links)
- On the domination search number (Q1811076) (← links)
- Efficiently enumerating minimal triangulations (Q1983135) (← links)
- On the complexity of computing treebreadth (Q1987233) (← links)
- Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition (Q2061992) (← links)
- Avoidable vertices and edges in graphs: existence, characterization, and applications (Q2065802) (← links)
- Minimum fill-in of sparse graphs: kernelization and approximation (Q2258069) (← links)
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds (Q2341752) (← links)
- Tree-decompositions with bags of small diameter (Q2370441) (← links)
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree (Q2378540) (← links)
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees (Q2403697) (← links)
- Approximating the path-distance-width for AT-free graphs and graphs in related classes (Q2442209) (← links)
- Searching for better fill-in (Q2453556) (← links)
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem (Q2656894) (← links)
- On the Number of Minimal Separators in Graphs (Q2827806) (← links)
- Approximability of the Path-Distance-Width for AT-free Graphs (Q3104783) (← links)
- Treewidth of planar graphs: connections with duality (Q3438941) (← links)
- Mixed Search Number of Permutation Graphs (Q3507333) (← links)
- A Characterisation of the Minimal Triangulations of Permutation Graphs (Q3508558) (← links)
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms (Q3508575) (← links)
- The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements (Q5099105) (← links)
- (Q5126619) (← links)
- (Q5150424) (← links)
- A CHARACTERIZATION OF k-TH POWERS P<sub>n,k</sub> OF PATHS IN TERMS OF k-TREES (Q5249270) (← links)
- To Approximate Treewidth, Use Treelength! (Q5741086) (← links)
- Finding cut-vertices in the square roots of a graph (Q5915963) (← links)
- On groups with chordal power graph, including a classification in the case of finite simple groups (Q6185342) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)
