Monday, January 1, 2012 CC-BY-NC
Bipartite Graph & Application of Max Flow Problem

Maintainer: admin

1Bipartite Graph

1.1Application of Flow Problem

1.1.1Disjoint Path Problem:(Directed Graph)

  • Input: A directed graph G with nodes s and t
  • Goal: find the maximum number of edge disjoint path from s to t.
  • example:

Work in Progress. I only try to put down stuff that I understand myself.