Near-Optimal Low-Congestion Shortcuts on Bounded Parameter Graphs.

Bernhard Haeupler Taisuke Izumi Goran Zuzic

Published in: DISC (2016)

Keyphrases

graph matching
bounded treewidth
input parameters
parameter values
graph theory
social networks
response time
high levels
congestion avoidance
end to end
directed graph
graph mining
highly correlated
ip networks
graph clustering