Space-efficient algorithms for reachability in directed geometric graphs

The problem of graph Reachability is to decide whether there is a path from one vertex to another in a given graph. In this paper, we study the Reachability problem on three distinct graph families - intersection graphs of Jordan regions, unit contact disk graphs (penny graphs), and chordal graphs....

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Theoretical computer science Jg. 961; S. 113938
Hauptverfasser:	Bhore, Sujoy, Jain, Rahul
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 15.06.2023
Schlagworte:	Geometric intersection graphs Reachability Space-efficient algorithms Geometric intersection graphs Space-efficient algorithms Reachability
ISSN:	0304-3975, 1879-2294
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!