Bandwidth on AT-free graphs

DOI10.1016/j.tcs.2011.09.011zbMath1228.68036MaRDI QIDQ650939

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

Publication date: 7 December 2011

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2011.09.011

zbMATH Keywords

algorithm; bandwidth; fixed-parameter tractable; AT-free graph

Mathematics Subject Classification ID

68Q25: Analysis of algorithms and problem complexity

05C78: Graph labelling (graceful graphs, bandwidth, etc.)

68Q17: Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.)

05C85: Graph algorithms (graph-theoretic aspects)

Uses Software

• symrcm