Login / Signup

Polynomial Algorithms for (integral) Maximum Two-flows in Vertex Edge-capacitated Planar Graphs.

Frieda GranotMichal Penn
Published in: Discret. Appl. Math. (1996)
Keyphrases
  • planar graphs
  • np hard
  • metaheuristic
  • graph theory
  • approximate inference
  • undirected graph