Space efficient algorithm for solving reachability using tree decomposition and separators (Q6199388): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Undirected connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: Relationships between nondeterministic and deterministic tape complexities / 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: $\widetilde{O}(\sqrt{n})$ -Space and Polynomial-Time Algorithm for Planar Directed Graph Reachability / 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: An <i>O</i> ( <i>n</i> <sup>ϵ</sup> ) Space and Polynomial Time Algorithm for Reachability in Directed Layered Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for NP-hard problems restricted to partial k- trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of Finding Embeddings in a <i>k</i>-Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Approximation Algorithms for Minimum Weight Vertex Separators / rank
 
Normal rank
Property / cites work
 
Property / cites work: Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Log-space algorithms for paths and matchings in \(k\)-trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space-efficient algorithms for reachability in directed geometric graphs / 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: A Separator Theorem for Chordal Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Algorithms with Optimal Speedup for Bounded Treewidth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tree decomposition-based indexing for efficient shortest path and nearest neighbors query answering on graphs / rank
 
Normal rank

Revision as of 12:20, 27 August 2024

scientific article; zbMATH DE number 7809102
Language Label Description Also known as
English
Space efficient algorithm for solving reachability using tree decomposition and separators
scientific article; zbMATH DE number 7809102

    Statements

    Space efficient algorithm for solving reachability using tree decomposition and separators (English)
    0 references
    0 references
    0 references
    23 February 2024
    0 references
    graph reachability
    0 references
    simultaneous time-space upper bound
    0 references
    tree decomposition
    0 references

    Identifiers