Bandwidth on AT-Free Graphs

DOI10.1007/978-3-642-10631-6_59zbMath1272.05199OpenAlexW1545655716MaRDI QIDQ3652244

Dieter Kratsch, Saket Saurabh, Pinar Heggernes, Daniel Lokshtanov, Petr A. Golovach, Daniel Meister

Publication date: 17 December 2009

Published in: Algorithms and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-10631-6_59

zbMATH Keywords

NP-completenessbandwidth problem

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (2)

A note on maximum differential coloring of planar graphs ⋮ Approximability of the Path-Distance-Width for AT-free Graphs

This page was built for publication: Bandwidth on AT-Free Graphs