scientific article; zbMATH DE number 7561625
From MaRDI portal
DOI10.4230/LIPIcs.ICALP.2019.132MaRDI QIDQ5092335
Matthias Bonne, Keren Censor-Hillel
Publication date: 21 July 2022
Full work available at URL: https://arxiv.org/abs/1904.11440
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
A note on improved results for one round distributed clique listing, On linear algebraic algorithms for the subgraph matching problem and its variants, Distributed Testing of Graph Isomorphism in the CONGEST Model.
Cites Work
- Unnamed Item
- Unnamed Item
- Distributed discovery of large near-cliques
- Distributed testing of excluded subgraphs
- Distributed coloring algorithms for triangle-free graphs
- On extremal problems of graphs and generalized graphs
- Large cuts with local algorithms on triangle-free graphs
- On the power of the congested clique model
- Deterministic Subgraph Detection in Broadcast CONGEST.
- Lower Bounds for Subgraph Detection in the CONGEST Model
- Local-on-Average Distributed Tasks
- Fully dynamic maximal independent set with sublinear update time
- Distributed Triangle Detection via Expander Decomposition
- Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
- Optimal Dynamic Distributed MIS
- Triangle Finding and Listing in CONGEST Networks
- Fast distributed algorithms for testing graph properties