An O(n^ε ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs.

Diptarka Chakraborty Raghunath Tewari

Published in: ISAAC (2015)

Keyphrases

computational complexity
dynamic programming
k means
planar graphs
special case
np hard
probabilistic model
bayesian framework
randomized algorithm
minimum weight
optimal solution
lower bound
graphical models
monte carlo
latent variables