Derivation of algorithms for cutwidth and related graph layout parameters
From MaRDI portal
Publication:1015810
DOI10.1016/j.jcss.2008.10.003zbMath1165.68523OpenAlexW2015482664WikidataQ57359781 ScholiaQ57359781MaRDI QIDQ1015810
Hans L. Bodlaender, Michael R. Fellows, Dimitrios M. Thilikos
Publication date: 30 April 2009
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://dspace.library.uu.nl/handle/1874/22002
Related Items
Fixed-Parameter Tractability of Treewidth and Pathwidth ⋮ A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth ⋮ Edge-treewidth: algorithmic and combinatorial properties ⋮ Order Reconfiguration under Width Constraints ⋮ Unnamed Item ⋮ Typical sequences revisited -- computing width parameters of graphs ⋮ Confronting intractability via parameters ⋮ Unnamed Item ⋮ The treewidth of line graphs ⋮ Myhill-Nerode Methods for Hypergraphs
Cites Work
- Graph minors. I. Excluding a forest
- Min Cut is NP-complete for edge weighted trees
- The vertex separation number of a graph equals its path-width
- A partial k-arboretum of graphs with bounded treewidth
- On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
- Constructive linear time algorithms for branchwidth
- Fixed-Parameter Tractability and Completeness I: Basic Results
- Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
- Mathematical Foundations of Computer Science 2003
- Cutwidth I: A linear time fixed parameter algorithm
- Cutwidth II: Algorithms for partial w-trees of bounded degree
- A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Derivation of algorithms for cutwidth and related graph layout parameters
