Maximum Flow in Directed Planar Graphs with Vertex Capacities.

Haim Kaplan Yahav Nussbaum

Published in: Algorithmica (2011)

Keyphrases

maximum flow
planar graphs
directed graph
flow network
minimum weight
undirected graph
push relabel
random walk
maximum cardinality
bipartite graph
spanning tree
directed acyclic graph
weighted graph
greedy heuristic
bayesian networks
shortest path