Sublinear-time distributed algorithms for detecting small cliques and even cycles (Q2146871): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 4 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W3215914422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Graph Coloring: Fundamentals and Recent Developments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycles of even length in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed discovery of large near-cliques / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Bound on the Number of Edges in Graphs Without an Even Cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast distributed algorithms for testing graph properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Algebraic methods in the congested clique / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Triangle Detection via Expander Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Distributed Expander Decomposition and Nearly Optimal Triangle Enumeration / rank
 
Normal rank
Property / cites work
 
Property / cites work: Arboricity and Subgraph Listing Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Almost tight bounds for rumour spreading with conductance / rank
 
Normal rank
Property / cites work
 
Property / cites work: Detecting cliques in CONGEST networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed edge connectivity in sublinear time / rank
 
Normal rank
Property / cites work
 
Property / cites work: “Tri, Tri Again”: Finding Triangles and Small Subgraphs in a Distributed Setting / 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: Distributed Strong Diameter Network Decomposition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed testing of excluded subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The History of Degenerate (Bipartite) Extremal Graph Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-Optimal Scheduling of Distributed Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Derandomizing Distributed Algorithms with Small Messages: Spanners and Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed MST and Routing in Almost Mixing Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5090923 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower Bounds for Subgraph Detection in the CONGEST Model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Triangle Finding and Listing in CONGEST Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating the Permanent / rank
 
Normal rank
Property / cites work
 
Property / cites work: Deterministic Subgraph Detection in Broadcast CONGEST. / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Note on Bipartite Graphs Without 2 k -Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the distributional complexity of disjointness / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polylogarithmic-time deterministic network decomposition and distributed derandomization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distributed Verification and Hardness of Distributed Approximation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3140437 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extremal problems for cycles in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4397004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Collective dynamics of ‘small-world’ networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Three notes on distributed property testing / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 12:23, 4 December 2024

scientific article
Language Label Description Also known as
English
Sublinear-time distributed algorithms for detecting small cliques and even cycles
scientific article

    Statements

    Sublinear-time distributed algorithms for detecting small cliques and even cycles (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    21 June 2022
    0 references
    distributed computing
    0 references
    subgraph freeness
    0 references
    expander decomposition
    0 references
    CONGEST
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references