Parallel algorithms on interval graphs (Q4359285): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Optimal Doubly Logarithmic Parallel Algorithms Based On Finding All Nearest Smaller Values / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some parallel algorithms on interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3328583 / 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: Depth-first search is inherently sequential / rank
 
Normal rank
Property / cites work
 
Property / cites work: Probabilistic parallel prefix computation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4138414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Parallel Algorithms for a Class of Graph Theoretic Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimal parallel algorithms for finding cut vertices and bridges of interval graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4893441 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4023519 / rank
 
Normal rank

Latest revision as of 19:22, 27 May 2024

scientific article; zbMATH DE number 1072393
Language Label Description Also known as
English
Parallel algorithms on interval graphs
scientific article; zbMATH DE number 1072393

    Statements