Automata, Languages and Programming

DOI10.1007/11523468zbMath1082.68591OpenAlexW2940595899WikidataQ56656999 ScholiaQ56656999MaRDI QIDQ5716790

Qian-Ping Gu, Hisao Tamaki

Publication date: 10 January 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11523468

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (9)

On the minimum corridor connection problem and other generalized geometric problems ⋮ Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms ⋮ Improved bounds on the planar branchwidth with respect to the largest grid minor size ⋮ Subexponential parameterized algorithms ⋮ Treewidth lower bounds with brambles ⋮ Computing branchwidth via efficient triangulations and blocks ⋮ Toward solving the Steiner travelling salesman problem on urban road maps using the branch decomposition of graphs ⋮ The carvingwidth of hypercubes ⋮ A Local Search Algorithm for Branchwidth

This page was built for publication: Automata, Languages and Programming