A reduction of the logspace shortest path problem to biconnected graphs.

Published in: CoRR (2015)

Keyphrases

shortest path problem
directed graph
shortest path
single source
interval data
combinatorial optimization problems
weighted graph
bi objective
multiple objectives
random walk
graph mining
graph theory
bipartite graph
graph partitioning
graph matching
graph model
undirected graph
data streams