On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model (Q6131191): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Determining the chromatic number of triangle-free \(2P_3\)-free graphs in polynomial time / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Distributed Computing: A Locality-Sensitive Approach / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the power of the congested clique model / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Color-coding / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Sublinear-time distributed algorithms for detecting small cliques and even cycles / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Algebraic methods in the congested clique / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On a problem of K. Zarankiewicz / rank | |||
Normal rank | |||
Revision as of 19:30, 29 August 2024
scientific article; zbMATH DE number 7827495
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model |
scientific article; zbMATH DE number 7827495 |
Statements
On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model (English)
0 references
4 April 2024
0 references
cycle-freeness
0 references
distributed computing
0 references
\textsc{CONGEST} model
0 references
0 references
