Sublinear-time distributed algorithms for detecting small cliques and even cycles
From MaRDI portal
Publication:6487531
DOI10.4230/lipics.disc.2019.15zbMath1515.68364MaRDI QIDQ6487531
Talya Eden, Nimrod Fiat, Rotem Oshman, Fabian Kuhn, Orr Fischer
Publication date: 3 February 2023
Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Distributed algorithms (68W15)
This page was built for publication: Sublinear-time distributed algorithms for detecting small cliques and even cycles