Line-Distortion, Bandwidth and Path-Length of a Graph

DOI10.1007/978-3-319-08404-6_14zbMath1420.05047OpenAlexW2738934863MaRDI QIDQ3188891

Ekkehard Köhler, Feodor F. Dragan, Arne Leitert

Publication date: 2 September 2014

Published in: Algorithm Theory – SWAT 2014 (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-08404-6_14

zbMATH Keywords

minimum bandwidthminimum line-distortionRobertson-Seymour's path-decomposition

Mathematics Subject Classification ID

Paths and cycles (05C38) Distance in graphs (05C12)

Related Items (6)

On the Minimum Eccentricity Shortest Path Problem ⋮ A short note on the complexity of computing strong pathbreadth ⋮ On the complexity of computing treebreadth ⋮ Line-distortion, bandwidth and path-length of a graph ⋮ On the Complexity of Computing Treebreadth ⋮ Minimum Eccentricity Shortest Paths in Some Structured Graph Classes

This page was built for publication: Line-Distortion, Bandwidth and Path-Length of a Graph