Exact and Approximate Bandwidth

DOI10.1007/978-3-642-02927-1_26MaRDI QIDQ3638043zbMATH OpenOpenAlexFDO

Authors Marek Cygan, Marcin Pilipczuk

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

Mathematics Subject Classification ID

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

Recommendations

• Exact and approximate bandwidth
• Faster Exact Bandwidth
• Even faster exact bandwidth
• An exponential time 2-approximation algorithm for bandwidth
• An exponential time 2-approximation algorithm for bandwidth

Cited in

(11)

• Capacitated domination faster than O(2ⁿ)
• Even faster exact bandwidth
• scientific article; zbMATH DE number 5770649 (Why is no real title available?)
• An exponential time 2-approximation algorithm for bandwidth
• An exponential time 2-approximation algorithm for bandwidth
• Bandwidth and distortion revisited
• scientific article; zbMATH DE number 4120213 (Why is no real title available?)
• Maximum Bandwidth Under Edge Addition
• Faster Exact Bandwidth
• Bandwidth on AT-free graphs
• Exact and approximate bandwidth

This page was built for publication: Exact and Approximate Bandwidth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3638043)