scientific article; zbMATH DE number 2080246

zbMATH Open1044.68709MaRDI QIDQ4472491FDOQ4472491

Authors: Dimitrios M. Thilikos, Maria Serna, Hans L. Bodlaender 

Publication date: 4 August 2004

Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1969/19690192.htm

Title of this publication is not available (Why is that?)

Recommendations

• Cutwidth I: A linear time fixed parameter algorithm
• A Linear-Time Algorithm for Finding Tree-Decompositions of Small Treewidth
• scientific article; zbMATH DE number 1875430
• Graph minors. II. Algorithmic aspects of tree-width
• scientific article; zbMATH DE number 1854105

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Analysis of algorithms (68W40) Network design and communication in computer systems (68M10)

Cited In (20)

• Designing low-congestion networks with structural graph theory
• The carving-width of generalized hypercubes
• A linear fixed parameter tractable algorithm for connected pathwidth
• Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem
• Computing Tree Decompositions
• Decentralized dynamics for finite opinion games
• Characterizing graphs of small carving-width
• C-planarity testing of embedded clustered graphs with bounded dual carving-width
• Confronting intractability via parameters
• Title not available (Why is that?)
• Finding branch-decompositions of matroids, hypergraphs, and more
• Alternative parameterizations of \textsc{Metric Dimension}
• Finding branch-decompositions of matroids, hypergraphs, and more
• The carvingwidth of hypercubes
• Testing branch-width
• Efficient reassembling of three-regular planar graphs
• A fixed parameter tractable approximation scheme for the optimal cut graph of a surface
• On the satisfiability of quantum circuits of small treewidth
• On the satisfiability of quantum circuits of small treewidth
• Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4472491)