arXiv · 2302.12628
Minimizing the effective graph resistance by adding links is NP-hard
Abstract
The effective graph resistance, also known as the Kirchhoff index, is metric that is used to quantify the robustness of a network. We show that the optimisation problem of minimizing the effective graph resistance of a graph by adding a fixed number of links, is NP-hard.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Robert E. Kooij, Massimo A. Achterberg. 2023-02-24. Minimizing the effective graph resistance by adding links is NP-hard. https://doi.org/10.1016/j.orl.2023.10.002
Cite the original work for its findings. Save a collection to share your selection of sources.