Treewidth and pathwidth of permutation graphs
DOI10.1007/3-540-56939-1_66zbMATH Open1418.68162OpenAlexW1491170911MaRDI QIDQ4630253FDOQ4630253
Authors: Ton Kloks, Dieter Kratsch, Hans L. Bodlaender 
Publication date: 29 March 2019
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/16657
Recommendations
- Treewidth and Pathwidth of Permutation Graphs
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Treewidth and minimum fill-in on permutation graphs in linear time
- Graph-Theoretic Concepts in Computer Science
- Computing the cutwidth of bipartite permutation graphs in linear time
Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)
Cites Work
- Title not available (Why is that?)
- Complexity of Finding Embeddings in a k-Tree
- Title not available (Why is that?)
- Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey
- Linear time algorithms for NP-hard problems restricted to partial k- trees
- Representation of a finite graph by a set of intervals on the real line
- Title not available (Why is that?)
- Permutation Graphs and Transitive Graphs
- On the pathwidth of chordal graphs
- On Comparability and Permutation Graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- The pathwidth and treewidth of cographs
- Title not available (Why is that?)
- Topics on perfect graphs
- Title not available (Why is that?)
Cited In (9)
- The Pathwidth and Treewidth of Cographs
- Treewidth and Pathwidth of Permutation Graphs
- Triangulating graphs without asteroidal triples
- Vertex ranking of asteroidal triple-free graphs
- The complexity of subgraph isomorphism for classes of partial k-trees
- The pathwidth and treewidth of cographs
- Graph-Theoretic Concepts in Computer Science
- Trivially-perfect width
- Graph searching on chordal graphs
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 Q4630253)
