Sciweavers

ESA
2007
Springer
140views Algorithms» more  ESA 2007»
14 years 5 months ago
On Minimum Power Connectivity Problems
Given a (directed or undirected) graph with edge costs, the power of a node is the maximum cost of an edge leaving it, and the power of the graph is the sum of the powers of its n...
Yuval Lando, Zeev Nutov