Login / Signup

Hardness of cut problems in directed graphs.

Julia ChuzhoySanjeev Khanna
Published in: STOC (2006)
Keyphrases
  • directed graph
  • np complete
  • optimization problems
  • benchmark problems
  • multi objective
  • worst case
  • solving problems
  • shortest path problem
  • computational problems
  • np hardness
  • maximum flow