Improved Space Efficient Algorithms for BFS, DFS and Applications (Q2817855): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computational Complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search Using $$O(n)$$ Bits / rank
 
Normal rank
Property / cites work
 
Property / cites work: $\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2968076 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Space Tradeoffs for Dynamic Programming Algorithms in Trees and Bounded Treewidth Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-time trade-offs for stack-based algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3024760 / rank
 
Normal rank
Property / cites work
 
Property / cites work: New Time-Space Upperbounds for Directed Reachability in High-genus and H-minor-free Graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3651735 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal Time-Space Tradeoff for the 2D Convex-Hull Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient Basic Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Listing All Maximal Cliques in Large Sparse Real-World Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper bounds for time-space trade-offs in sorting and selection / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Framework for Dynamizing Succinct Data Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Succinct data structures for searchable partial sums with optimal worst-case performance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection and sorting with limited storage / rank
 
Normal rank
Property / cites work
 
Property / cites work: Selection from read-only memory and sorting with minimum data movement / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple test on 2-vertex- and 2-edge-connectivity / rank
 
Normal rank

Latest revision as of 12:01, 12 July 2024

scientific article
Language Label Description Also known as
English
Improved Space Efficient Algorithms for BFS, DFS and Applications
scientific article

    Statements

    Improved Space Efficient Algorithms for BFS, DFS and Applications (English)
    0 references
    0 references
    0 references
    0 references
    2 September 2016
    0 references

    Identifiers