An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs (Q1767365): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q4091421 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster algorithms for the shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the exponent of all pairs shortest path problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to parallel depth-first traversals of general trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Breadth-first traversal of trees and integer sorting in parallel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear-Time Representation Algorithms for Proper Circular-Arc Graphs and Proper Interval Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140413 / rank
 
Normal rank
Property / cites work
 
Property / cites work: All pairs shortest distances for graphs with small integer length edges / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for interval graphs and circular-arc graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm to solve the all-pairs shortest paths problem on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4887753 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4385175 / rank
 
Normal rank
Property / cites work
 
Property / cites work: One-dimensional logic gate assignment and interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An optimal algorithm to solve the all-pair shortest path problem on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Test for Circular-Arc Graphs / rank
 
Normal rank

Revision as of 18:45, 7 June 2024

scientific article
Language Label Description Also known as
English
An optimal parallel algorithm for solving all-pairs shortest paths problem on circular-arc graphs
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references