Login / Signup
A Combinatorial Algorithm for All-Pairs Shortest Paths in Directed Vertex-Weighted Graphs with Applications to Disc Graphs
Andrzej Lingas
Dzmitry Sledneu
Published in:
CoRR (2011)
Keyphrases
</>
weighted graph
graph structure
np hard
vertex set
learning algorithm
undirected graph
graph partitioning
edge weights
high dimensional
shortest path
directed graph
spanning tree
parameter selection
random graphs
regularization framework
minimum weight