Minimizing the effective graph resistance by adding links is NP-hard.

Robert E. Kooij Massimo A. Achterberg

Published in: Oper. Res. Lett. (2023)

Keyphrases

np hard
graph theory
link analysis
computational complexity
special case
data sets
random walk
approximation algorithms
neural network
high quality
optimal solution
graph structure
weighted graph
graph representation
greedy heuristic
min sum