Derivation of algorithms for cutwidth and related graph layout parameters
type: Item
instance of: scholarly article
title: Derivation of algorithms for cutwidth and related graph layout parameters
zbMATH Open document ID: 1165.68523
author: Hans L. Bodlaender
author: Michael R. Fellows
author: Dimitrios M. Thilikos
published in: Journal of Computer and System Sciences
publication date: 2009-04-30T00:00:00Z
full work available at URL: https://dspace.library.uu.nl/handle/1874/22002
Mathematics Subject Classification ID: 68W05
Mathematics Subject Classification ID: 68Q45
zbMATH DE Number: 5550299
zbMATH Keywords: parameterized algorithms
zbMATH Keywords: layout parameters
zbMATH Keywords: cutwidth
zbMATH Keywords: pathwidth
zbMATH Keywords: modified cutwidth
zbMATH Keywords: finite state automata
MaRDI profile type: Publication
OpenAlex ID: W2015482664
Wikidata QID: Q57359781
cites work: Q4273870
cites work: Q4250226
cites work: Q4699283
cites work: A partial k-arboretum of graphs with bounded treewidth
cites work: A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
cites work: Mathematical Foundations of Computer Science 2003
cites work: Efficient and Constructive Algorithms for the Pathwidth and Treewidth of Graphs
cites work: Constructive linear time algorithms for branchwidth
cites work: Q4246756
cites work: Fixed-Parameter Tractability and Completeness I: Basic Results
cites work: On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
cites work: The vertex separation number of a graph equals its path-width
cites work: Q4863506
cites work: Q4036591
cites work: Q3477966
cites work: Min Cut is NP-complete for edge weighted trees
cites work: Graph minors. I. Excluding a forest
cites work: Q3396557
cites work: Cutwidth I: A linear time fixed parameter algorithm
cites work: Cutwidth II: Algorithms for partial w-trees of bounded degree
DOI: 10.1016/J.JCSS.2008.10.003
description: scientific article; zbMATH DE number 5550299