Characterizations and algorithmic applications of chordal graph embeddings
From MaRDI portal
(Redirected from Publication:1372739)
Recommendations
Cites work
- scientific article; zbMATH DE number 437538 (Why is no real title available?)
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 4147519 (Why is no real title available?)
- scientific article; zbMATH DE number 3896983 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 566078 (Why is no real title available?)
- scientific article; zbMATH DE number 1414319 (Why is no real title available?)
- scientific article; zbMATH DE number 3307330 (Why is no real title available?)
- A linear time algorithm for finding tree-decompositions of small treewidth
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Approximating the bandwidth for asteroidal triple-free graphs
- Beyond NP-completeness for problems of bounded width: hardness for the W hierarchy (extended abstract)
- Claw-free graphs---a survey
- Complexity of Finding Embeddings in a k-Tree
- Computing the Minimum Fill-In is NP-Complete
- Easy problems for tree-decomposable graphs
- Graph minors. II. Algorithmic aspects of tree-width
- How to use the minimal separators of a graph for its chordal triangulation
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- On rigid circuit graphs
- On the complexity of DNA physical mapping
- Optimal node ranking of trees
- Representation of a finite graph by a set of intervals on the real line
- The NP-completeness of the bandwidth minimization problem
- The Pathwidth and Treewidth of Cographs
- The bandwidth problem for graphs and matrices—a survey
- Transitiv orientierbare Graphen
- Treewidth and Pathwidth of Permutation Graphs
- Treewidth. Computations and approximations
- Triangulating graphs without asteroidal triples
Cited in
(55)- Listing all the minimal separators of a 3-connected planar graph
- Treewidth of planar graphs: connections with duality
- Separator theorems for interval graphs and proper interval graphs
- A Characterisation of the Minimal Triangulations of Permutation Graphs
- Separator orders in interval, cocomparability, and AT-free graphs
- Treewidth and minimum fill-in on permutation graphs in linear time
- On the number of minimal separators in graphs
- Two characterisations of minimal triangulations of \(2K_{2}\)-free graphs
- Organizing the atoms of the clique separator decomposition into an atom tree
- Connected graph searching in chordal graphs
- Minimal split completions
- On a property of minimal triangulations
- The Smallest Classes of Binary and Ternary Matroids Closed under Direct Sums and Complements
- Approximating the treewidth of AT-free graphs.
- Efficiently decomposing, recognizing and triangulating hole-free graphs without diamonds
- On claw-free asteroidal triple-free graphs
- Searching for better fill-in
- Boxicity and cubicity of asteroidal triple free graphs
- Approximability of the path-distance-width for AT-free graphs
- Dynamic programming and planarity: improved tree-decomposition based algorithms
- Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
- scientific article; zbMATH DE number 7250384 (Why is no real title available?)
- Graphs with at most two moplexes
- Minimal triangulations of graphs: a survey
- Chordal embeddings of planar graphs
- On the complexity of computing treebreadth
- Computing branchwidth via efficient triangulations and blocks
- Fast minimal triangulation algorithm using minimum degree criterion
- On the domination search number
- Approximating the path-distance-width for AT-free graphs and graphs in related classes
- Induced matchings in asteroidal triple-free graphs
- Chordality properties on graphs and minimal conceptual connections in semantic data models
- On the minimum chordal completion polytope
- Listing all potential maximal cliques of a graph
- Sequential and parallel triangulating algorithms for elimination game and new insights on minimum degree
- scientific article; zbMATH DE number 7310078 (Why is no real title available?)
- Minimum fill-in of sparse graphs: kernelization and approximation
- How to Use Planarity Efficiently: New Tree-Decomposition Based Algorithms
- Efficiently enumerating minimal triangulations
- Exploiting variable sparsity in computing equilibria of biological dynamical systems by triangular decomposition
- On treewidth approximations.
- To approximate treewidth, use treelength!
- Avoidable vertices and edges in graphs: existence, characterization, and applications
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
- Finding cut-vertices in the square roots of a graph
- Towards using the chordal graph polytope in learning decomposable models
- Faster parameterized algorithms for \textsc{Minimum Fill-in}
- Phylogenetic trees defined by at most three characters
- Single-edge monotonic sequences of graphs and linear-time algorithms for minimal completions and deletions
- Mixed Search Number of Permutation Graphs
- On groups with chordal power graph, including a classification in the case of finite simple groups
- A CHARACTERIZATION OF k-TH POWERS Pn,k OF PATHS IN TERMS OF k-TREES
- Two characterisations of the minimal triangulations of permutation graphs
- Definability equals recognizability for \(k\)-outerplanar graphs and \(l\)-chordal partial \(k\)-trees
- Tree-decompositions with bags of small diameter
This page was built for publication: Characterizations and algorithmic applications of chordal graph embeddings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1372739)
