Solving the shortest-paths problem on bipartite permutation graphs efficiently (Q672656): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3484355 / rank
 
Normal rank
Property / cites work
 
Property / cites work: APPLICATION OF BROADCASTING WITH SELECTIVE REDUCTION TO THE MAXIMAL SUM SUBSEGMENT PROBLEM / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel time bounds for the maximum clique problem on intervals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient parallel algorithms for bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate Parallel Scheduling. Part I: The Basic Technique with Applications to Optimal Parallel List Ranking in Logarithmic Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Upper and Lower Time Bounds for Parallel Random Access Machines without Simultaneous Writes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Matrix and Graph Algorithms / 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: Fibonacci heaps and their uses in improved network optimization algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Transitive Orientation of Graphs and Identification of Permutation Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bipartite permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new upper bound on the complexity of the all pairs shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on Boolean Matrices / rank
 
Normal rank

Latest revision as of 11:19, 27 May 2024

scientific article
Language Label Description Also known as
English
Solving the shortest-paths problem on bipartite permutation graphs efficiently
scientific article

    Statements

    Solving the shortest-paths problem on bipartite permutation graphs efficiently (English)
    0 references
    0 references
    28 February 1997
    0 references
    0 references
    Parallel algorithms
    0 references
    Shortest paths
    0 references
    Bipartite permutation graphs
    0 references
    Upper and lower bounds
    0 references