Space-efficient algorithms for reachability in directed geometric graphs (Q6039899): Difference between revisions

@@ Property / cites work @@
+Planar and grid graph reachability problems
@@ Property / cites work: Planar and grid graph reachability problems / rank @@
+Normal rank
@@ Property / cites work @@
+Linear time algorithms for NP-hard problems restricted to partial k- trees
+Normal rank
@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Depth-First Search Using $$O(n)$$ Bits
@@ Property / cites work: Depth-First Search Using $$O(n)$$ Bits / rank @@
+Normal rank
@@ Property / cites work @@
+$\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability
+Normal rank
@@ Property / cites work @@
+Space efficient linear time algorithms for BFS, DFS and applications
+Normal rank
@@ Property / cites work @@
+A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity
+Normal rank
@@ Property / cites work @@
+The balanced connected subgraph problem for geometric intersection graphs
+Normal rank
@@ Property / cites work @@
+Balanced line separators of unit disk graphs
@@ Property / cites work: Balanced line separators of unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A note on maximum independent sets and minimum clique partitions in unit disk graphs and penny graphs: complexity and approximation
+Normal rank
@@ Property / cites work @@
+New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs.
+Normal rank
@@ Property / cites work @@
+An             <i>O</i>             (             <i>n</i>             <sup>ϵ</sup>             ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs
+Normal rank
@@ Property / cites work @@
+Approximation algorithms for maximum independent set of pseudo-disks
+Normal rank
@@ Property / cites work @@
+Bend-Bounded Path Intersection Graphs: Sausages, Noodles, and Waffles on a Grill
+Normal rank
@@ Property / cites work @@
+Unit disk graphs
@@ Property / cites work: Unit disk graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On rigid circuit graphs
@@ Property / cites work: On rigid circuit graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Embedding and canonizing graphs of bounded genus in logspace
+Normal rank
@@ Property / cites work @@
+Separator theorems and Turán-type results for planar intersection graphs
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The intersection graphs of subtrees in trees are exactly the chordal graphs
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Chordal Graphs
@@ Property / cites work: A Separator Theorem for Chordal Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Compressed Decision Problems in Hyperbolic Groups.
+Normal rank
@@ Property / cites work @@
+Halving Balls in Deterministic Linear Time
@@ Property / cites work: Halving Balls in Deterministic Linear Time / rank @@
+Normal rank
@@ Property / cites work @@
+Finding the connected components and a maximum clique of an intersection graph of rectangles in the plane
+Normal rank
@@ Property / cites work @@
+Q5875652
@@ Property / cites work: Q5875652 / rank @@
+Normal rank
@@ Property / cites work @@
+Q5875572
@@ Property / cites work: Q5875572 / rank @@
+Normal rank
@@ Property / cites work @@
+Symmetric space-bounded computation
@@ Property / cites work: Symmetric space-bounded computation / rank @@
+Normal rank
@@ Property / cites work @@
+A Separator Theorem for Planar Graphs
@@ Property / cites work: A Separator Theorem for Planar Graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On the power of unambiguity in log-space
@@ Property / cites work: On the power of unambiguity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+Triangulated graphs and the elimination process
@@ Property / cites work: Triangulated graphs and the elimination process / rank @@
+Normal rank
@@ Property / cites work @@
+Q5683627
@@ Property / cites work: Q5683627 / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Relationships between nondeterministic and deterministic tape complexities
+Normal rank
@@ Property / cites work @@
+Reachability in K 3,3-Free Graphs and K 5-Free Graphs Is in Unambiguous Log-Space
+Normal rank
@@ Property / cites work @@
+The complexity of graph connectivity
@@ Property / cites work: The complexity of graph connectivity / rank @@
+Normal rank