Space-efficient algorithms for reachability in directed geometric graphs

DOI10.1016/J.TCS.2023.113938MaRDI QIDQ6039899zbMATH OpenOpenAlexFDO

Authors Sujoy Bhore, Rahul Jain

Publication date 23 May 2023

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

Full work available at URL https://arxiv.org/abs/2101.05235

zbMATH Keywords

geometric intersection graphsreachabilityspace-efficient algorithms

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Abstract: 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. For each of these graph families, we present space-efficient algorithms for the Reachability problem. For intersection graphs of Jordan regions, we show how to obtain a "good" vertex separator in a space-efficient manner and use it to solve the Reachability in polynomial time and $O(m^{1/2}logn)$ space, where $n$ is the number of Jordan regions, and $m$ is the total number of crossings among the regions. We use a similar approach for chordal graphs and obtain a polynomial-time and $O(m^{1/2}logn)$ space algorithm, where $n$ and $m$ are the number of vertices and edges, respectively. However, we use a more involved technique for unit contact disk graphs (penny graphs) and obtain a better algorithm. We show that for every $epsilon>0$, there exists a polynomial-time algorithm that can solve Reachability in an $n$ vertex directed penny graph, using $O(n^{1/4+epsilon})$ space. We note that the method used to solve penny graphs does not extend naturally to the class of geometric intersection graphs that include arbitrary size cliques.

Recommendations

• Space complexity of the directed reachability problem over surface-embedded graphs
• Efficient Algorithms for Geometric Graph Search Problems
• \(\widetilde{O}(\sqrt{n})\)-space and polynomial-time algorithm for planar directed graph reachability
• An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
• An O ( n ^ϵ ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
• Improved Dynamic Reachability Algorithms for Directed Graphs
• scientific article; zbMATH DE number 1798166
• Space efficient algorithms for directed series–parallel graphs
• Geometric speed-up techniques for finding shortest paths in large sparse graphs
• scientific article; zbMATH DE number 1302178

Cites work

• \(\widetilde{O}(\sqrt{n})\)-space and polynomial-time algorithm for planar directed graph reachability
• A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
• A Separator Theorem for Chordal Graphs
• A Separator Theorem for Planar Graphs
• A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
• Algorithmic Aspects of Vertex Elimination on Graphs
• An O ( n ^ϵ ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
• Approximation algorithms for maximum independent set of pseudo-disks
• Balanced line separators of unit disk graphs
• Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
• Compressed Decision Problems in Hyperbolic Groups.
• Computational Complexity
• Depth-First Search Using O(n) Bits
• Embedding and canonizing graphs of bounded genus in logspace
• Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
• Halving balls in deterministic linear time
• scientific article; zbMATH DE number 3420184 (Why is no real title available?)
• scientific article; zbMATH DE number 7650245 (Why is no real title available?)
• scientific article; zbMATH DE number 7650316 (Why is no real title available?)
• Incidence matrices and interval graphs
• Linear time algorithms for NP-hard problems restricted to partial k- trees
• New time-space upperbounds for directed reachability in high-genus and H-minor-free graphs
• On rigid circuit graphs
• On the power of unambiguity in log-space
• Planar and grid graph reachability problems
• Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space
• Relationships between nondeterministic and deterministic tape complexities
• Separator theorems and Turán-type results for planar intersection graphs
• Space efficient linear time algorithms for BFS, DFS and applications
• Symmetric space-bounded computation
• The balanced connected subgraph problem for geometric intersection graphs
• The complexity of graph connectivity
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• Triangulated graphs and the elimination process
• Undirected connectivity in log-space
• Unit disk graphs

Cited in

(10)

• Space complexity of reachability testing in labelled graphs
• An $$O(n^{\epsilon })$$ Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
• Efficient Algorithms for Geometric Graph Search Problems
• scientific article; zbMATH DE number 1798166 (Why is no real title available?)
• An O ( n ^ϵ ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
• Space Complexity of Reachability Testing in Labelled Graphs
• scientific article; zbMATH DE number 7650316 (Why is no real title available?)
• O'Reach: Even Faster Reachability in Large Graphs
• Space-efficient algorithms for reachability in directed geometric graphs
• Space efficient algorithm for solving reachability using tree decomposition and separators

This page was built for publication: Space-efficient algorithms for reachability in directed geometric graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6039899)