On Bounding the Bandwidth of Graphs with Symmetry
Work
Year: 2014
Type: article
Abstract: We derive a new lower bound for the bandwidth of a graph that is based on a new lower bound for the minimum cut problem. Our new semidefinite programming relaxation of the minimum cut problem is obtai... more
Source: INFORMS journal on computing
Authors Edwin van Dam, Renata Sotirov
Institution Tilburg University
Cites: 47
Cited by: 9
Related to: 10
FWCI: 1.096
Citation percentile (by year/subfield): 63.4
Subfield: Electrical and Electronic Engineering
Field: Engineering
Domain: Physical Sciences
Open Access status: green