Faster Shortest Path Algorithm for H-Minor Free Graphs with Negative Edge Weights

Christian Wulff-Nilsen

Published in: CoRR (2010)

Keyphrases

edge weights
shortest path
shortest path algorithm
weighted graph
graph clustering
minimum spanning tree
dense subgraphs
minimum weight
directed graph
satisfy the triangle inequality
geodesic distance
spanning tree
bipartite graph
multiscale
segmentation algorithm
dynamic graph
graph cuts
higher order