Minimizing the effective graph resistance by adding links is NP-hard
type: Item
instance of: scholarly article
title: Minimizing the effective graph resistance by adding links is NP-hard
author: Robert E. Kooij
author: Massimo A. Achterberg
published in: Operations Research Letters
publication date: 2024-06-17T00:00:00Z
Mathematics Subject Classification ID: 90-XX
zbMATH DE Number: 7865913
zbMATH Keywords: effective graph resistance
zbMATH Keywords: graph augmentation
zbMATH Keywords: NP-hard
MaRDI profile type: Publication
cites work: Bounding robustness in complex networks under topological changes through majorization techniques
cites work: Effective graph resistance
cites work: Q5682350
cites work: Some simplified NP-complete graph problems
cites work: Resistance distance in complete \(n\)-partite graphs
cites work: Minimizing Effective Resistance of a Graph
cites work: A topological investigation of phase transitions of cascading failures in power grids
cites work: Q5156350
cites work: Maximum algebraic connectivity augmentation is NP-hard
cites work: Q5280013
DOI: 10.1016/J.ORL.2023.10.002
description: scientific article; zbMATH DE number 7865913