scientific article; zbMATH DE number 2080246

zbMath1044.68709MaRDI QIDQ4472491

Dimitrios M. Thilikos, Maria J. 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: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

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

Related Items (19)

Computing Tree Decompositions ⋮ A Fixed Parameter Tractable Approximation Scheme for the Optimal Cut Graph of a Surface ⋮ Decentralized dynamics for finite opinion games ⋮ A Linear Fixed Parameter Tractable Algorithm for Connected Pathwidth ⋮ On the Satisfiability of Quantum Circuits of Small Treewidth ⋮ Testing branch-width ⋮ Finding branch-decompositions of matroids, hypergraphs, and more ⋮ Efficient reassembling of three-regular planar graphs ⋮ On the satisfiability of quantum circuits of small treewidth ⋮ Unnamed Item ⋮ Inapproximability of rank, clique, Boolean, and maximum induced matching-widths under small set expansion hypothesis ⋮ Characterizing graphs of small carving-width ⋮ Confronting intractability via parameters ⋮ The carving-width of generalized hypercubes ⋮ Tailored heuristics in adaptive large neighborhood search applied to the cutwidth minimization problem ⋮ The carvingwidth of hypercubes ⋮ Alternative parameterizations of \textsc{Metric Dimension} ⋮ C-planarity testing of embedded clustered graphs with bounded dual carving-width ⋮ Finding Branch-Decompositions of Matroids, Hypergraphs, and More

This page was built for publication: