Login / Signup

Sparsest cuts and concurrent flows in product graphs.

Paul S. Bonsma
Published in: Discret. Appl. Math. (2004)
Keyphrases
  • graph theory
  • graph matching
  • graph representation
  • graph theoretic
  • directed graph
  • product information
  • production planning
  • data sets
  • software development
  • graph structure
  • graph databases
  • product design
  • random graphs