Login / Signup

Nontrivial Lower Bounds for some NP-Problems on Directed Graphs.

Solomampionona Ranaivoson
Published in: CSL (1990)
Keyphrases
  • directed graph
  • lower bound
  • np complete
  • np hard
  • upper bound
  • undirected graph
  • optimal solution
  • computational complexity
  • randomly generated problems