Depth-First Search Using $$O(n)$$ Bits (Q2942660): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Tetsuo Asano / rank
Normal rank
 
Property / author
 
Property / author: Tetsuo Asano / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/978-3-319-13075-0_44 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2284006119 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A random NC algorithm for depth first search / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallelism and the maximal path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Priority Queues and Sorting for Read-Only Data / rank
 
Normal rank
Property / cites work
 
Property / cites work: Time-Space Tradeoffs for All-Nearest-Larger-Neighbors Problems / 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: A Sublinear Space, Polynomial Time Algorithm for Directed s-t Connectivity / rank
 
Normal rank
Property / cites work
 
Property / cites work: Embedding and canonizing graphs of bounded genus in logspace / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4298260 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-first search is inherently sequential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Depth-First Search and Linear Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Parallel Algorithms for All-Sources Lexicographic Search and Path-Algebra Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomially improved efficiency for fast parallel single-source lexicographic depth-first search, breadth-first search, and topological-first search / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 17:49, 10 July 2024

scientific article
Language Label Description Also known as
English
Depth-First Search Using $$O(n)$$ Bits
scientific article

    Statements

    Depth-First Search Using $$O(n)$$ Bits (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    11 September 2015
    0 references

    Identifiers