Approximating unweighted connectivity problems in parallel (Q1854474): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Scan-First Search and Sparse Certificates: An Improved Parallel Algorithm for <i>k</i>-Vertex Connectivity / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4875165 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q5501842 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3140408 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4845372 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4763401 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: An improved parallel algorithm for maximal matching / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Derandomization through approximation / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4385522 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3138952 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4234045 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Biconnectivity approximations and graph carvings / rank | |||
Normal rank |
Latest revision as of 11:13, 5 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Approximating unweighted connectivity problems in parallel |
scientific article |
Statements
Approximating unweighted connectivity problems in parallel (English)
0 references
14 January 2003
0 references
0 references