Login / Signup

n) Algorithm for Maximum Flow in Undirected Planar Networks.

Refael HassinDonald B. Johnson
Published in: SIAM J. Comput. (1985)
Keyphrases
  • maximum flow
  • minimum cut
  • np hard
  • dynamic programming
  • probabilistic model
  • k means
  • energy function
  • optimal solution
  • objective function
  • simulated annealing
  • ant colony optimization
  • tree structure
  • min cut max flow