An efficient parallel algorithm for shortest paths in planar layered digraphs (Q1899220): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for String Editing and Related Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a routing problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3798227 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3785966 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on two problems in connexion with graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast Algorithms for Shortest Paths in Planar Graphs, with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385522 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding small simple cycle separators for 2-connected planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applications of a Planar Separator Theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast and efficient solution of path algebra problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: The parallel computation of minimum cost paths in graphs by stream contraction / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic maintenance of planar digraphs, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Transitive Closure and Point Location in Planar Structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf01294130 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1972455324 / rank
 
Normal rank

Latest revision as of 10:10, 30 July 2024

scientific article
Language Label Description Also known as
English
An efficient parallel algorithm for shortest paths in planar layered digraphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references