Login / Signup
Õ(√n)-Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability.
Tetsuo Asano
David G. Kirkpatrick
Kotaro Nakagawa
Osamu Watanabe
Published in:
MFCS (2) (2014)
Keyphrases
</>
directed graph
computational complexity
worst case
shortest path problem
learning algorithm
optimal solution
np hard
dynamic programming
np complete
detection algorithm
combinatorial optimization
simulated annealing
higher dimensional
spanning tree
expectation maximization
special case
objective function