Maximum algebraic connectivity augmentation is NP-hard
- 30 November 2008
- journal article
- research article
- Published by Elsevier BV in Operations Research Letters
- Vol. 36 (6), 677-679
- https://doi.org/10.1016/j.orl.2008.09.001
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- Expander graphs and their applicationsBulletin of the American Mathematical Society, 2006
- Growing Well-connected GraphsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2006
- Transportation in graphs and the admittance spectrumDiscrete Applied Mathematics, 1987
- Some simplified NP-complete graph problemsTheoretical Computer Science, 1976