Simultaneous Time-Space Upper Bounds for Red-Blue Path Problem in Planar DAGs.

Diptarka Chakraborty Raghunath Tewari

Published in: WALCOM (2015)

Keyphrases

upper bound
lower bound
space time
free space
equivalence classes
color images
efficiently computable
lower and upper bounds
worst case
probability distribution
shortest path
branch and bound algorithm
directed acyclic graph
d objects
scheduling problem
data points
tight bounds