Login / Signup
Faster replacement paths algorithms in case of edge or node failure for undirected, positive integer weighted graphs.
Jay Mahadeokar
Sanjeev Saxena
Published in:
J. Discrete Algorithms (2013)
Keyphrases
</>
weighted graph
edge weights
shortest path
undirected graph
discrete data
positive integer
learning algorithm
social networks
data structure
directed graph
data objects
graph structure
regularization framework
random walk
spanning tree