Sign in

Maximum directed cuts in digraphs with degree restriction.

Jenö LehelFrédéric MaffrayMyriam Preissmann
Published in: J. Graph Theory (2009)
Keyphrases
  • equivalence classes
  • e learning
  • case study
  • high level
  • objective function
  • information technology
  • dynamical systems
  • directed graph
  • maximum number