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

Diptarka Chakraborty Raghunath Tewari

Published in: CoRR (2015)

Keyphrases

planar graphs
computational complexity
np hard
worst case
objective function
dynamic programming
image segmentation
knapsack problem
expectation maximization
high dimensional
markov random field
graph cuts
em algorithm
random fields
max cut