Shortest Two Disjoint Paths in Conservative Graphs.

Ildikó Schlotter

Published in: STACS (2024)

Keyphrases

data sets
disjoint paths
undirected graph
directed graph
approximation algorithms
graph theoretic
random walk
random graphs
spanning tree
graph theory
graph structure
graph representation
graph model
series parallel
graph structures
directed acyclic graph
shortest path
minimum cost
gray scale
data mining