Distributed testing of excluded subgraphs

DOI10.1007/978-3-662-53426-7_25zbMath1393.68133arXiv1605.03719OpenAlexW2366922697MaRDI QIDQ1660944

Pierre Fraigniaud, Ivan Rapaport, Ioan Todinca, Jarkko Peltomäki

Publication date: 16 August 2018

Full work available at URL: https://arxiv.org/abs/1605.03719

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Randomized algorithms (68W20) Distributed algorithms (68W15)

Related Items (8)

Sublinear-time distributed algorithms for detecting small cliques and even cycles ⋮ Property testing of planarity in the \textsf{CONGEST} model ⋮ Deterministic Subgraph Detection in Broadcast CONGEST. ⋮ Distributed Testing of Distance-k Colorings ⋮ Unnamed Item ⋮ Fooling views: a new lower bound technique for distributed computations under congestion ⋮ Distributed Testing of Graph Isomorphism in the CONGEST Model. ⋮ Unnamed Item

This page was built for publication: Distributed testing of excluded subgraphs