Even Faster Exact Bandwidth

DOI10.1145/2071379.2071387zbMath1295.68130arXiv0902.1661OpenAlexW2015540687MaRDI QIDQ3189049

Marek Cygan, Marcin Pilipczuk

Publication date: 9 September 2014

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0902.1661

zbMATH Keywords

bandwidthexact algorithmsmeasure and conquer

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (7)

An exponential time 2-approximation algorithm for bandwidth ⋮ Bandwidth and distortion revisited ⋮ Tractabilities and intractabilities on geometric intersection graphs ⋮ Exact algorithms for minimum weighted dominating induced matching ⋮ A dual representation simulated annealing algorithm for the bandwidth minimization problem on graphs ⋮ Exact and approximate bandwidth ⋮ An Exponential Time 2-Approximation Algorithm for Bandwidth

This page was built for publication: Even Faster Exact Bandwidth