Lowering eccentricity of a tree by node upgrading

DOI10.1002/net.20069zbMath1081.68071OpenAlexW2953654910MaRDI QIDQ5463675

Toshihide Ibaraki, Yann Vaxès, Xiao-guang Yang

Publication date: 5 August 2005

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20069

zbMATH Keywords

treeeccentricitylinecontinuous upgrading strategydiscrete upgrading strategyedge upgradingnode upgrading

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items

Lagrangian and branch-and-cut approaches for upgrading spanning tree problems, The \(p\)-median problem with upgrading of transportation costs and minimum travel time allocation, A class of node based bottleneck improvement problems

Cites Work

• Unnamed Item