Distributed detection of cliques in dynamic networks
From MaRDI portal
Recommendations
Cites work
- Detecting cliques in CONGEST networks
- Deterministic subgraph detection in broadcast CONGEST
- Distributed coloring algorithms for triangle-free graphs
- Distributed discovery of large near-cliques
- Distributed testing of excluded subgraphs
- Distributed triangle detection via expander decomposition
- Fully Dynamic Maximal Independent Set with Sublinear in n Update Time
- Fully dynamic maximal independent set with sublinear update time
- Large cuts with local algorithms on triangle-free graphs
- Local-on-average distributed tasks
- Lower bounds for subgraph detection in the CONGEST model
- On extremal problems of graphs and generalized graphs
- On the power of the congested clique model
- Optimal dynamic distributed MIS
- Self-stabilization
- Three notes on distributed property testing
- Triangle Finding and Listing in CONGEST Networks
Cited in
(8)- Distributed detection of clusters of arbitrary size
- Fast deterministic algorithms for highly-dynamic networks
- Distributed subgraph finding: progress and challenges (invited talk)
- Distributed Testing of Graph Isomorphism in the CONGEST Model.
- On linear algebraic algorithms for the subgraph matching problem and its variants
- A note on improved results for one round distributed clique listing
- Distributed discovery of large near-cliques
- Very large cliques are easy to detect
This page was built for publication: Distributed detection of cliques in dynamic networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5092335)
