Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs (Q5458836): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
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-540-77050-3_18 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1537214435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Planar and grid graph reachability problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Algebraic Formulas Using a Constant Number of Registers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Treewidth: Characterizations, Applications, and Computations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel algorithms for series parallel graphs and graphs with treewidth two / 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: Two Applications of Inductive Counting for Complementation Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Directed Planar Reachability Is in Unambiguous Log-Space / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Optimal Parallel Algorithm for Formula Evaluation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in digraphs of small treewidth. II: Optimal parallel algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest paths in digraphs of small treewidth. I: Sequential algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Division in logspace-uniform<i>NC</i><sup>1</sup> / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topology of series-parallel networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel recognition of series-parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel recognition and decomposition of two terminal series parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4535013 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4737163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Space efficient algorithms for directed series–parallel graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for Graphs of Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Complexity of Finding Paths in Graphs with Bounded Independence Number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Undirected ST-connectivity in log-space / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded Tree-Width and LOGCFL / rank
 
Normal rank

Latest revision as of 21:09, 27 June 2024

scientific article; zbMATH DE number 5267226
Language Label Description Also known as
English
Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs
scientific article; zbMATH DE number 5267226

    Statements

    Logspace Algorithms for Computing Shortest and Longest Paths in Series-Parallel Graphs (English)
    0 references
    0 references
    0 references
    24 April 2008
    0 references
    Series-parallel graphs
    0 references
    logspace algorithms
    0 references
    distance problem
    0 references
    longest path problem
    0 references
    bounded tree-width
    0 references
    \(K _{4}\)-minor-free graphs
    0 references

    Identifiers