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....

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 961; s. 113938
Hlavní autori:	Bhore, Sujoy, Jain, Rahul
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 15.06.2023
Predmet:	Geometric intersection graphs Reachability Space-efficient algorithms Geometric intersection graphs Space-efficient algorithms Reachability
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!