Successive approximation in parallel graph algorithms (Q5096155): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q3798261 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3341891 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parallel ear decomposition search (EDS) and st-numbering in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An O(logn) parallel connectivity algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Parallel Biconnectivity Algorithm / rank
 
Normal rank

Revision as of 21:15, 29 July 2024

scientific article; zbMATH DE number 7571928
Language Label Description Also known as
English
Successive approximation in parallel graph algorithms
scientific article; zbMATH DE number 7571928

    Statements

    Successive approximation in parallel graph algorithms (English)
    0 references
    0 references
    0 references
    0 references
    16 August 2022
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references