Login / Signup

Iterative algorithms for generating minimal cutsets in directed graphs.

Douglas R. ShierDavid E. Whited
Published in: Networks (1986)
Keyphrases
  • directed graph
  • iterative algorithms
  • random walk
  • undirected graph
  • dual formulation
  • directed acyclic graph
  • low rank approximation
  • disjoint paths
  • pairwise
  • linear programming
  • web graph
  • maximum flow