Maximum algebraic connectivity augmentation is NP-hard

Operations Research Letters

Volumn 36, Issue 6, 2008, Pages 677-679

  Mosk Aoyama, Damon ^a  

^a Stanford University   (United States)

Author keywords

Algebraic connectivity; Computational complexity

Indexed keywords

COMPUTATIONAL COMPLEXITY; NUCLEAR PROPULSION;

ALGEBRAIC CONNECTIVITIES; ALGEBRAIC CONNECTIVITY; AUGMENTED GRAPHS; EIGENVALUE; INPUT GRAPHS; LAPLACIAN; NP-HARD;

GRAPH THEORY;

EID: 54249163585     PISSN: 01676377     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.orl.2008.09.001     Document Type: Article

References (7)

1. Fiedler M. Algebraic connectivity of graphs. Czechoslovak Mathematical Journal 23 98 (1973) 298-305
2. Garey M.R., Johnson D.S., and Stockmeyer L. Some simplified NP-complete graph problems. Theoretical Computer Science 1 3 (1976) 237-267
3. A. Ghosh, S. Boyd, Growing well-connected graphs, in: Proceedings of the 45th IEEE Conference on Decision and Control, 2006, pp. 6605-6611
4. Hoory S., Linial N., and Wigderson A. Expander graphs and their applications. Bulletin (New Series) of the American Mathematical Society 43 4 (2006) 439-561
5. Horn R.A., and Johnson C.A. Matrix Analysis (1985), Cambridge University Press, Cambridge
6. Lovász L. Semidefinite programs and combinatorial optimization. In: Reed B.A., and Sales C.L. (Eds). Recent Advances in Algorithms and Combinatorics (2003), Springer-Verlag, New York 137-194
7. Maas C. Transportation in graphs and the admittance spectrum. Discrete Applied Mathematics 16 1 (1987) 31-49