Back to Search
Start Over
On bounding the bandwidth of graphs with symmetry
- Source :
- INFORMS Journal on Computing. Wntr, 2015, Vol. 27 Issue 1, p75, 14 p.
- Publication Year :
- 2015
-
Abstract
- We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the min-cut problem. Our new semidefinite programming relaxation of [...]
Details
- Language :
- English
- ISSN :
- 10919856
- Volume :
- 27
- Issue :
- 1
- Database :
- Gale General OneFile
- Journal :
- INFORMS Journal on Computing
- Publication Type :
- Academic Journal
- Accession number :
- edsgcl.404446715
- Full Text :
- https://doi.org/10.1287/ijoc.2014.0611