Successive approximation in parallel graph algorithms (Q914386): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
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 |
Latest revision as of 16:45, 20 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Successive approximation in parallel graph algorithms |
scientific article |
Statements
Successive approximation in parallel graph algorithms (English)
0 references
1990
0 references
parallel graph algorithms
0 references
mesh of trees
0 references