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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 961; p. 113938
Main Authors:	Bhore, Sujoy, Jain, Rahul
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 15.06.2023
Subjects:	Geometric intersection graphs Reachability Space-efficient algorithms Geometric intersection graphs Space-efficient algorithms Reachability
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!