The complexity of the approximation of the bandwidth problem

DOI10.1109/SFCS.1998.743431MaRDI QIDQ6909515zbMATH OpenFDO

Authors Walter Unger

Publication date 29 October 2025

Full work available at URL https://doi.org/10.1109/SFCS.1998.743431

Mathematics Subject Classification ID

Proceedings, conferences, collections, etc. pertaining to computer science (68-06)

Cited in

(1)

• Exact and approximate digraph bandwidth

This page was built for publication: The complexity of the approximation of the bandwidth problem

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