Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph (Q4870967): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Computation of the center and diameter of outerplanar graphs / 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: A unified approach to parallel depth-first traversals of general trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3898496 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A unified approach to domination problems on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel Merge Sort / 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: A simple linear-time algorithm for computing the center of an interval graph / rank
 
Normal rank

Latest revision as of 11:22, 24 May 2024

scientific article; zbMATH DE number 861037
Language Label Description Also known as
English
Optimal sequential and parallel algorithms for computing the diameter and the center of an interval graph
scientific article; zbMATH DE number 861037

    Statements