Dynamic reachability in planar digraphs with one source and one sink

This publication has 15 references indexed in Scilit:

• Efficient Point Location in a Convex Spatial Cell-Complex
  SIAM Journal on Computing, 1992
• On-line graph algorithms with SPQR-trees
  Published by Springer Nature ,1990
• Fully Dynamic Point Location in a Monotone Subdivision
  SIAM Journal on Computing, 1989
• Dynamic data structures for series parallel digraphs
  Published by Springer Nature ,1989
• Incremental planarity testing
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1989
• Finding paths and deleting edges in directed acyclic graphs
  Information Processing Letters, 1988
• Fully dynamic techniques for point location and transitive closure in planar structures
  Published by Institute of Electrical and Electronics Engineers (IEEE) ,1988
• Posets, boolean representations and quick path searching
  Published by Springer Nature ,1987
• Amortized efficiency of a path retrieval data structure
  Theoretical Computer Science, 1986
• On the vector representation of the reachability in planar directed graphs
  Information Processing Letters, 1975