Bipartition constrained edge-splitting in directed graphs.

Harold N. Gabow Tibor Jordán

Published in: Discret. Appl. Math. (2001)

Keyphrases

directed graph
disjoint paths
undirected graph
strongly connected
edge weights
random walk
maximum flow
edge detection
directed acyclic graph
graph structure
graph structures
machine learning
spanning tree
case study
edge detector
constrained problems