From A log-space algorithm for reachability in planar acyclic digraphs with few sources, joint work with Chris Bourke and N. V. Vinodchandran.
This figure helps visualize two cases for reachability after an update of the explored region. The key insight of the paper was to reduce the locality of the search to these "back and forth" between trees.
No comments:
Post a Comment