Dynamic reachability in planar digraphs with one source and one sink

DOI10.1016/0304-3975(93)90164-OzbMath0830.68105OpenAlexW2022812949MaRDI QIDQ688163

Roberto Tamassia, Ioannis. G. Tollis

Publication date: 28 November 1993

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(93)90164-o

zbMATH Keywords

reachability problem

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Related Items (4)

A data structure for lattice representation ⋮ Fully Dynamic Transitive Closure in plane dags with one source and one sink ⋮ Join-reachability problems in directed graphs ⋮ Augmenting Geometric Graphs with Matchings

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dynamic maintenance of planar digraphs, with applications
• A unified approach to visibility representations of planar graphs
• Amortized efficiency of a path retrieval data structure
• Finding paths and deleting edges in directed acyclic graphs
• Light sources, obstructions and spherical orders
• On the vector representation of the reachability in planar directed graphs
• Representations of Graphs on a Cylinder
• Efficient Point Location in a Convex Spatial Cell-Complex
• Fully Dynamic Point Location in a Monotone Subdivision

This page was built for publication: Dynamic reachability in planar digraphs with one source and one sink