Dynamic reachability in planar digraphs with one source and one sink
type: Item
instance of: scholarly article
title: Dynamic reachability in planar digraphs with one source and one sink
zbMATH Open document ID: 0830.68105
DOI: 10.1016/0304-3975(93)90164-O
author: Roberto Tamassia
author: Ioannis G. Tollis
published in: Theoretical Computer Science
publication date: 1993-11-28T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 440336
zbMATH Keywords: reachability problem
MaRDI profile type: Publication
cites work: Q3138873
cites work: Q4038721
cites work: Light sources, obstructions and spherical orders
cites work: Q3783593
cites work: Amortized efficiency of a path retrieval data structure
cites work: Finding paths and deleting edges in directed acyclic graphs
cites work: Q4028899
cites work: On the vector representation of the reachability in planar directed graphs
cites work: Q3813313
cites work: Q5596083
cites work: Efficient Point Location in a Convex Spatial Cell-Complex
cites work: Fully Dynamic Point Location in a Monotone Subdivision
cites work: Q3795247
cites work: Dynamic maintenance of planar digraphs, with applications
cites work: A unified approach to visibility representations of planar graphs
cites work: Representations of Graphs on a Cylinder
cites work: Q3707420
full work available at URL: 0304-3975(93)90164-o
OpenAlex ID: W2022812949
description: scientific article; zbMATH DE number 440336