Maximum algebraic connectivity augmentation is NP-hard

From MaRDI portal
Publication:2517792

DOI10.1016/j.orl.2008.09.001zbMath1152.05343OpenAlexW2090718545MaRDI QIDQ2517792

Damon Mosk-Aoyama

Publication date: 9 January 2009

Published in: Operations Research Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.orl.2008.09.001




Related Items (14)



Cites Work


This page was built for publication: Maximum algebraic connectivity augmentation is NP-hard