On Bounding the Bandwidth of Graphs with Symmetry
From MaRDI portal
Publication:2942684
DOI10.1287/ijoc.2014.0611zbMath1327.90359arXiv1212.0694OpenAlexW2149344437MaRDI QIDQ2942684
Renata Sotirov, van Dam, Edwin R.
Publication date: 11 September 2015
Published in: INFORMS Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1212.0694
Related Items (5)
Lower bounds for the bandwidth problem ⋮ The MIN-cut and vertex separator problem ⋮ $L_p$-norm Regularization Algorithms for Optimization Over Permutation Matrices ⋮ Semidefinite programming and eigenvalue bounds for the graph partition problem ⋮ On the bandwidth of the Kneser graph
This page was built for publication: On Bounding the Bandwidth of Graphs with Symmetry