Simple and efficient network decomposition and synchronization
type: Item
instance of: scholarly article
title: Simple and efficient network decomposition and synchronization
zbMATH Open document ID: 0944.68002
DOI: 10.1016/S0304-3975(98)00206-0
published in: Theoretical Computer Science
publication date: 2000-08-21T00:00:00Z
Mathematics Subject Classification ID: 68M10
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1493437
zbMATH Keywords: graph decompositions
zbMATH Keywords: asynchronous communication networks
zbMATH Keywords: synchronizers
author: Shlomo Moran
author: Sagi Snir
MaRDI profile type: Publication
cites work: Sparser: A Paradigm for Running Distributed Algorithms
cites work: Complexity of network synchronization
cites work: Routing with Polynomial Communication-Space Trade-Off
cites work: Online tracking of mobile users
cites work: Q3883524
cites work: Optimal distributed algorithm for minimum spanning trees revisited
cites work: A Distributed Algorithm for Minimum-Weight Spanning Trees
cites work: Low diameter graph decompositions
full work available at URL: s0304-3975(98)00206-0
OpenAlex ID: W2126251084
description: scientific article; zbMATH DE number 1493437