Treewidth and Pathwidth of Permutation Graphs
From MaRDI portal
Publication:4863978
Recommendations
- Treewidth and pathwidth of permutation graphs
- Treewidth and minimum fill-in on permutation graphs in linear time
- Graph-Theoretic Concepts in Computer Science
- The pathwidth and treewidth of cographs
- The Pathwidth and Treewidth of Cographs
- scientific article; zbMATH DE number 3855165
- scientific article; zbMATH DE number 1109395
- Tree-width and circumference of graphs
- scientific article; zbMATH DE number 772777
- scientific article; zbMATH DE number 1868528
Cited in
(55)- On a property of minimal triangulations
- Treewidth of cocomparability graphs and a new order-theoretic parameter
- Measuring the vulnerability for classes of intersection graphs
- Treewidth for graphs with small chordality
- Characterizations and algorithmic applications of chordal graph embeddings
- Recognizing interval digraphs and interval bigraphs in polynomial time
- On treewidth and minimum fill-in of asteroidal triple-free graphs
- Approximating the treewidth of AT-free graphs.
- Chordal embeddings of planar graphs
- Edge and node searching problems on trees
- Approximation algorithms for classes of graphs excluding single-crossing graphs as minors
- Approximate search strategies for weighted trees
- On the vertex ranking problem for trapezoid, circular-arc and other graphs
- A linear time algorithm for minimum fill-in and treewidth for distance hereditary graphs
- Locally definable vertex set properties are efficiently enumerable
- How to compute digraph width measures on directed co-graphs
- On the maximum weight minimal separator
- Linear rank-width and linear clique-width of trees
- Computing \(K\)-terminal reliability of \(d\)-trapezoid graphs
- Node-searching problem on block graphs
- The first order definability of graphs with separators via the Ehrenfeucht game
- Polynomially bounding the number of minimal separators in graphs: reductions, sufficient conditions, and a dichotomy theorem
- Finding a maximum minimal separator: graph classes and fixed-parameter tractability
- Vertex ranking of asteroidal triple-free graphs
- Large Induced Subgraphs via Triangulations and CMSO
- On the maximum weight minimal separator
- Computing directed pathwidth in O(1.89ⁿ) time
- On distance-\(d\) Independent Set and other problems in graphs with ``few minimal separators
- Combining intensification and diversification strategies in VNS. An application to the vertex separation problem
- Variable neighborhood search for the vertex separation problem
- Mixed Search Number of Permutation Graphs
- A Characterisation of the Minimal Triangulations of Permutation Graphs
- Two characterisations of the minimal triangulations of permutation graphs
- Edge search number of cographs
- Treewidth and Minimum Fill-in on d-Trapezoid Graphs
- Restricted vertex multicut on permutation graphs
- Constructive linear time algorithms for branchwidth
- Treewidth and pathwidth of permutation graphs
- How to use the minimal separators of a graph for its chordal triangulation
- A polynomial-time algorithm for computing \(K\)-terminal residual reliability of \(d\)-trapezoid graphs
- As Time Goes By: Reflections on Treewidth for Temporal Graphs
- GENERATING ALL THE MINIMAL SEPARATORS OF A GRAPH
- Experimental evaluation of a branch-and-bound algorithm for computing pathwidth and directed pathwidth
- Edge Search Number of Cographs in Linear Time
- Pathwidth is NP-Hard for Weighted Trees
- Treewidth computations. II. Lower bounds
- Graph-Theoretic Concepts in Computer Science
- On finding separators in temporal split and permutation graphs
- On finding separators in temporal split and permutation graphs
- The firebreak problem
- Treewidth and minimum fill-in on permutation graphs in linear time
- A linear time algorithm to list the minimal separators of chordal graphs
- The firefighter problem on graph classes
- On probe permutation graphs
- Computing branchwidth via efficient triangulations and blocks
This page was built for publication: Treewidth and Pathwidth of Permutation Graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4863978)
