Optimal distributed algorithms in unlabeled tori and chordal rings

DOI10.1006/jpdc.1997.1389zbMath0896.68064OpenAlexW2066274820MaRDI QIDQ1384522

Bernard Mans

Publication date: 1 October 1998

Published in: Journal of Parallel and Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/1882cde488e770503c1fa39bdbe58e0403f0e2be

zbMATH Keywords

distributed algorithmsmessage complexity

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (14)

OPTIMAL CONSTRUCTION OF SENSE OF DIRECTION IN A TORUS BY A MOBILE AGENT ⋮ DECONTAMINATING CHORDAL RINGS AND TORI USING MOBILE AGENTS ⋮ Algorithmic and explicit determination of the Lovász number for certain circulant graphs ⋮ EFFICIENT GRID EXPLORATION WITH A STATIONARY TOKEN ⋮ The novel generally described graphs for cyclic orthogonal double covers of some circulants ⋮ Torus orientation ⋮ Random walks, bisections and gossiping in circulant graphs ⋮ Testing set proportionality and the Ádám isomorphism of circulant graphs ⋮ Optimal irreversible dynamos in chordal rings ⋮ Optimal routing in double loop networks ⋮ Enumerating typical abelian prime-fold coverings of a circulant graph ⋮ A note on the Ádám conjecture for double loops. ⋮ Sense of direction in distributed computing ⋮ Integral circulant graphs

This page was built for publication: Optimal distributed algorithms in unlabeled tori and chordal rings