Login / Signup
) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs.
Diptarka Chakraborty
Raghunath Tewari
Published in:
Electron. Colloquium Comput. Complex. (2015)
Keyphrases
</>
computational complexity
planar graphs
worst case
k means
objective function
special case
dynamic programming
optimal solution
np hard
expectation maximization
graph structure
maximum likelihood estimation
max cut
probabilistic model
state space
connected components