Fetching the paper…
Reading the bibliography…
We present simple deterministic algorithms for subgraph finding and enumeration in the broadcast CONGEST model of distributed computation: -- For any constant $k$, detecting $k$-paths and trees on $k$ nodes can be done in $O(1)$ rounds.
A problem in graph theory
P. Erdős, A. Hajnal, and J. W. Moon · 1964
Earlier work this paper cites.
Decomposition of finite graphs into forests
Crispin Nash-Williams · 1964
Earlier work this paper cites.
How to find long paths efficiently
Burkhard Monien · 1985
Earlier work this paper cites.
Planar orientations with low out-degree and compaction of adjacency matrices
Marek Chrobak and David Eppstein · 1991
Earlier work this paper cites.
Parameterized computational feasibility
Rodney G. Downey and Michael R. Fellows · 1994
Earlier work this paper cites.
Color-coding
Noga Alon, Raphael Yuster, and Uri Zwick · 1995
Earlier work this paper cites.
Distributed Computing: A Locality-Sensitive Approach
David Peleg · 2000
Earlier work this paper cites.
Parameterized algorithms and hardness results for some graph motif problems
Nadja Betzler, Michael R. Fellows, Christian Komusiewicz, and Rolf Niedermeier · 2008
Earlier work this paper cites.
A parameterized view on matroid optimization problems
Dániel Marx · 2009
Earlier work this paper cites.
Sublogarithmic distributed MIS algorithm for sparse graphs using Nash-Williams decomposition
Leonid Barenboim and Michael Elkin · 2010
Cited alongside, same era.
“Tri, tri again”: Finding triangles and small subgraphs in a distributed setting
Danny Dolev, Christoph Lenzen, and Shir Peled · 2012
Cited alongside, same era.
A note on the Turán function of even cycles
Oleg Pikhurko · 2012
Cited alongside, same era.
Exploiting locality in distributed SDN control
Stefan Schmid and Jukka Suomela · 2013
Cited alongside, same era.
On the power of the congested clique model
Andrew Drucker, Fabian Kuhn, and Rotem Oshman · 2014
Cited alongside, same era.
Efficient computation of representative sets with applications in parameterized and exact algorithms
Fast distributed algorithms for testing graph properties
Keren Censor-Hillel, Eldar Fischer, Gregory Schwartzman, Yadu Vasudev, and David Ilcinkas · 2016
Later among the works it cites.
Distributed testing of excluded subgraphs
Pierre Fraigniaud, Ivan Rapaport, Ville Salo, and Ioan Todinca · 2016
Later among the works it cites.
Tight bounds for distributed graph computations, 2016
Gopal Pandurangan, Peter Robinson, and Michele Scquizzato · 2016
Later among the works it cites.
Narrow sieves for parameterized paths and packings
Andreas Björklund, Thore Husfeldt, Petteri Kaski, and Mikko Koivisto · 2017
Closest in time.
Three notes on distributed property testing
Guy Even, Orr Fischer, Pierre Fraigniaud, Tzlil Gonen, Reut Levi, Moti Medina, Dennis Olivetti Pedro Montealegre, Rotem Oshman, Ivan Rapaport, and Ioan Todinca · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Fedor V. Fomin, Daniel Lokshtanov, and Saket Saurabh · 2014
Cited alongside, same era.
Engineering motif search for large graphs
Andreas Björklund, Petteri Kaski, Łukasz Kowalik, and Juho Lauri · 2015
Cited alongside, same era.
Algebraic methods in the congested clique
Keren Censor-Hillel, Petteri Kaski, Janne H. Korhonen, Christoph Lenzen, Ami Paz, and Jukka Suomela · 2015
Cited alongside, same era.
The locality of distributed symmetry breaking
Leonid Barenboim, Michael Elkin, Seth Pettie, and Johannes Schneider · 2016
Cited alongside, same era.
Guy Even, Reut Levi, and Moti Medina
Cited in the paper.
Closest in time.
Distributed property testing for subgraph-freeness revisited, 2017
Orr Fischer, Tzlil Gonen, and Rotem Oshman · 2017
Closest in time.
Distributed subgraph detection, 2017
Pierre Fraigniaud, Pedro Montealegre, Dennis Olivetti, Ivan Rapaport, and Ioan Todinca · 2017
Closest in time.
Triangle finding and listing in CONGEST networks
Taisuke Izumi and François Le Gall · 2017
Closest in time.
Deterministic subgraph detection in broadcast CONGEST, 2017
Janne H. Korhonen and Joel Rybicki · 2017
Closest in time.