Space-efficient algorithms for maximum cardinality search, its applications, and variants of BFS (Q2420652): Difference between revisions

@@ Property / cites work @@
+Computational Complexity
@@ Property / cites work: Computational Complexity / rank @@
+Normal rank
@@ Property / cites work @@
+Reprint of: Memory-constrained algorithms for simple polygons
+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 @@
+Improved Space Efficient Algorithms for BFS, DFS and Applications
+Normal rank
@@ Property / cites work @@
+Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs
+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 @@
+Maximal Label Search Algorithms to Compute Perfect and Minimal Elimination Orderings
+Normal rank
@@ Property / cites work @@
+Biconnectivity, Chain Decomposition and st-Numbering Using O(n) Bits
+Normal rank
@@ Property / cites work @@
+Biconnectivity, \(st\)-numbering and other applications of DFS using \(O(n)\) bits
+Normal rank
@@ Property / cites work @@
+Space-efficient algorithms for maximum cardinality search, stack BFS, queue BFS and applications
+Normal rank
@@ Property / cites work @@
+Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem
+Normal rank
@@ Property / cites work @@
+Tight Lower Bounds for <i>st</i>-Connectivity on the NNJAG Model
+Normal rank
@@ Property / cites work @@
+Incidence matrices and interval graphs
@@ Property / cites work: Incidence matrices and interval graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic graph theory and perfect graphs
@@ Property / cites work: Algorithmic graph theory and perfect graphs / rank @@
+Normal rank
@@ Property / cites work @@
+A model classifying algorithms as inherently sequential with applications to graph searching
+Normal rank
@@ Property / cites work @@
+A general label search to investigate classical graph search algorithms
+Normal rank
@@ Property / cites work @@
+Selection and sorting with limited storage
@@ Property / cites work: Selection and sorting with limited storage / rank @@
+Normal rank
@@ Property / cites work @@
+New linear time algorithms for generating perfect elimination orderings of chordal graphs
+Normal rank
@@ Property / cites work @@
+Undirected connectivity in log-space
@@ Property / cites work: Undirected connectivity in log-space / rank @@
+Normal rank
@@ Property / cites work @@
+Algorithmic Aspects of Vertex Elimination on Graphs
+Normal rank
@@ Property / cites work @@
+Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
+Normal rank
@@ Property / cites work @@
+Two Familiar Transitive Closure Algorithms Which Admit No Polynomial Time, Sublinear Space Implementations
+Normal rank