Login / Signup

The complexity of two graph orientation problems.

Nicole EggemannSteven D. Noble
Published in: Discret. Appl. Math. (2012)
Keyphrases
  • solving problems
  • graph representation
  • random walk
  • bipartite graph
  • computational cost
  • worst case
  • optimization problems
  • graph based algorithm
  • polynomial hierarchy
  • polynomial time complexity