Sciweavers

ORL
2008
115views more  ORL 2008»
13 years 5 months ago
Maximum algebraic connectivity augmentation is NP-hard
The algebraic connectivity of a graph, which is the second-smallest eigenvalue of the Laplacian of the graph, is a measure of connectivity. We show that the problem of adding a sp...
Damon Mosk-Aoyama