2 citations · 3 across the 3 of their papers we have counts for
1 paper · 1 filter
Nachshon Cohen, Zeev Nutov
Given a graph with edge costs, the {\em power} of a node is themaximum cost of an edge incident to it, and the power of a graph is the sum of the powers of its nodes. Motivated by…