Login / Signup
A More Fine-Grained Complexity Analysis of Finding the Most Vital Edges for Undirected Shortest Paths.
Cristina Bazgan
Till Fluschnik
André Nichterlein
Rolf Niedermeier
Maximilian Stahlberg
Published in:
CoRR (2018)
Keyphrases
</>
fine grained
shortest path
complexity analysis
weighted graph
coarse grained
directed graph
edge weights
shortest path problem
theoretical analysis
shortest path algorithm
lower bound
road network
access control
path length
travel time
computational complexity
optimal path
first order logic
minimal surface
machine learning
data lineage
finding the shortest path
strongly connected components
spatial networks
high level