Login / Signup

) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs.

Diptarka ChakrabortyRaghunath Tewari
Published in: ACM Trans. Comput. Theory (2018)
Keyphrases
  • planar graphs
  • dynamic programming
  • objective function
  • computational complexity
  • np hard
  • worst case
  • optimal solution
  • monte carlo
  • k means
  • special case
  • state space
  • upper bound
  • expectation maximization
  • convex hull