Exact and Approximate Bandwidth
From MaRDI portal
Publication:3638043
DOI10.1007/978-3-642-02927-1_26zbMath1248.68371OpenAlexW1489272444MaRDI QIDQ3638043
Publication date: 14 July 2009
Published in: Automata, Languages and Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-02927-1_26
Graph theory (including graph drawing) in computer science (68R10) Graph minors (05C83) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (5)
Bandwidth and distortion revisited ⋮ Capacitated domination faster than \(O(2^n)\) ⋮ Bandwidth on AT-free graphs ⋮ Exact and approximate bandwidth ⋮ An Exponential Time 2-Approximation Algorithm for Bandwidth
This page was built for publication: Exact and Approximate Bandwidth