Space-efficient algorithms for reachability in directed geometric graphs

Article Properties
Cite
Bhore, Sujoy, and Rahul Jain. “Space-Efficient Algorithms for Reachability in Directed Geometric Graphs”. Theoretical Computer Science, vol. 961, 2023, p. 113938, https://doi.org/10.1016/j.tcs.2023.113938.
Bhore, S., & Jain, R. (2023). Space-efficient algorithms for reachability in directed geometric graphs. Theoretical Computer Science, 961, 113938. https://doi.org/10.1016/j.tcs.2023.113938
Bhore, Sujoy, and Rahul Jain. “Space-Efficient Algorithms for Reachability in Directed Geometric Graphs”. Theoretical Computer Science 961 (2023): 113938. https://doi.org/10.1016/j.tcs.2023.113938.
1.
Bhore S, Jain R. Space-efficient algorithms for reachability in directed geometric graphs. Theoretical Computer Science. 2023;961:113938.
Journal Categories
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Science
Mathematics
Instruments and machines
Electronic computers
Computer science
Computer software
Technology
Electrical engineering
Electronics
Nuclear engineering
Electronics
Computer engineering
Computer hardware
You May Also Like
Refrences
Title Journal Journal Categories Citations Publication Date
Space Efficient Linear Time Algorithms for BFS, DFS and Applications Theory of Computing Systems
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 12 2018
Approximation Algorithms for Maximum Independent Set of Pseudo-Disks Discrete & Computational Geometry
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
 51 2012
On the power of unambiguity in log-space computational complexity
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics
  • Technology: Engineering (General). Civil engineering (General)
  • Technology: Engineering (General). Civil engineering (General)
 2 2012
A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation RAIRO - Theoretical Informatics and Applications
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Technology: Technology (General): Industrial engineering. Management engineering: Applied mathematics. Quantitative methods
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 4 2011
Planar and Grid Graph Reachability Problems Theory of Computing Systems
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
  • Science: Mathematics
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science: Computer software
  • Technology: Electrical engineering. Electronics. Nuclear engineering: Electronics: Computer engineering. Computer hardware
  • Science: Mathematics: Instruments and machines: Electronic computers. Computer science
 15 2009