Sublinear fully distributed partition with applications
type: Item
instance of: scholarly article
title: Sublinear fully distributed partition with applications
zbMATH Open document ID: 1206.68358
author: Bilel Derbel
author: Mohamed Mosbah
author: A. Zemmari
published in: Theory of Computing Systems
publication date: 2010-10-06T00:00:00Z
Mathematics Subject Classification ID: 68W15
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W20
zbMATH DE Number: 5796557
zbMATH Keywords: distributed algorithm
zbMATH Keywords: distributed model
zbMATH Keywords: time complexity
zbMATH Keywords: sparse partition
zbMATH Keywords: graph spanner
MaRDI profile type: Publication
full work available at URL: s00224-009-9190-x
OpenAlex ID: W2135007303
cites work: Sparser: A Paradigm for Running Distributed Algorithms
cites work: On sparse spanners of weighted graphs
cites work: Complexity of network synchronization
cites work: Routing with Polynomial Communication-Space Trade-Off
cites work: Online tracking of mobile users
cites work: Fast distributed network decompositions and covers
cites work: Near-Linear Time Construction of Sparse Neighborhood Covers
cites work: Q4449190
cites work: New constructions of \(({\alpha}, {\beta})\)-spanners and purely additive spanners
cites work: Self-stabilizing deterministic network decomposition
cites work: Mathematical Foundations of Computer Science 2005
cites work: Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
cites work: Deterministic small-world communication networks
cites work: Q4282585
cites work: On the locality of distributed sparse spanner construction
cites work: Computing almost shortest paths (extended abstract)
cites work: $(1 + \epsilon,\beta)$-Spanner Constructions for General Graphs
cites work: Efficient algorithms for constructing (1+,ε, β)-spanners in the distributed and streaming models
cites work: Centralized broadcast in multihop radio networks
cites work: A SubLinear Time Distributed Algorithm for Minimum-Weight Spanning Trees
cites work: Characterizations of classes of graphs recognizable by local computations
cites work: Fast Distributed Construction of Smallk-Dominating Sets and Applications
cites work: Locality in Distributed Graph Algorithms
cites work: Different local controls for graph relabeling systems
cites work: Randomized local elections.
cites work: Simple and efficient network decomposition and synchronization
cites work: Distributed Computing: A Locality-Sensitive Approach
cites work: A near-tight lower bound on the time complexity of distributed minimum-weight spanning tree construction
cites work: Low Distortion Spanners
cites work: Distributed algorithms for ultrasparse spanners and linear size skeletons
cites work: Automata, Languages and Programming
cites work: Spanners and emulators with sublinear distance errors
DOI: 10.1007/S00224-009-9190-X
description: scientific article; zbMATH DE number 5796557