Minimizing the effective graph resistance by adding links is NP-hard
Fuente:
arXiv
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866929327663218688 |
|---|---|
| author | Kooij, Robert E. Achterberg, Massimo A. |
| author_facet | Kooij, Robert E. Achterberg, Massimo A. |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2302_12628 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Minimizing the effective graph resistance by adding links is NP-hard Kooij, Robert E. Achterberg, Massimo A. Physics and Society 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. |
| title | Minimizing the effective graph resistance by adding links is NP-hard |
| topic | Physics and Society |
| url | https://arxiv.org/abs/2302.12628 |