Minimum Cost Flows in Graphs with Unit Capacities.

Andrew V. Goldberg Haim Kaplan Sagi Hed Robert Endre Tarjan

Published in: STACS (2015)

Keyphrases

minimum cost
spanning tree
undirected graph
np hard
network flow
network flow problem
approximation algorithms
edit operations
capacity constraints
network simplex algorithm
minimum cost flow
graph matching
random graphs
directed graph
graph databases
graph representation
np complete
graph mining
upper bound