"Tri, Tri again": Finding Triangles and Small Subgraphs in a Distributed Setting

Dolev, Danny; Lenzen, Christoph; Peled, Shir

doi:10.48550/arxiv.1201.6652

Search citation statements

Order By: Relevance

Paper Sections

Select...

Number Of Distinct Values1

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2014

Publication Types

Select...

Book1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(1 citation statement)

References 0 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Turning to the distributed realm, in recent years there have been many studies focusing on the analysis of distributed algorithms on the complete graph K n , cf. [33,5,11,20,13,27,35,26,24]. We believe that some of those algorithms can be extended to, and applied in, the context of core-periphery networks, which provide a much larger family of graphs.…”

Section: Number Of Distinct Valuesmentioning

confidence: 99%

Distributed Computing on Core-Periphery Networks: Axiom-Based Design

Avin

Borokhovich

Lotker

et al. 2014

Automata, Languages, and Programming

View full text Add to dashboard Cite

Inspired by social networks and complex systems, we propose a core-periphery network architecture that supports fast computation for many distributed algorithms and is robust and efficient in number of links. Rather than providing a concrete network model, we take an axiom-based design approach. We provide three intuitive and independent algorithmic axioms and prove that any network that satisfies all axioms enjoys an efficient algorithm for a range of tasks (such as MST, sparse matrix multiplication, and more). We also show the minimality of our axiom set: for networks that satisfy any subset of the axioms, the same efficiency cannot be guaranteed for any deterministic algorithm.

show abstract