On the power of threshold-based algorithms for detecting cycles in the \textsc{CONGEST} model (Q6131191): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Normalize DOI.
 
(4 intermediate revisions by 3 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.tcs.2024.114500 / rank
Normal rank
 
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.tcs.2024.114500 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4392888682 / rank
 
Normal rank
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
Property / cites work
 
Property / cites work: Three notes on distributed property testing / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.TCS.2024.114500 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:44, 30 December 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
    0 references
    0 references
    0 references
    4 April 2024
    0 references
    cycle-freeness
    0 references
    distributed computing
    0 references
    \textsc{CONGEST} model
    0 references

    Identifiers