Optimal distributed algorithms in unlabeled tori and chordal rings
type: Item
instance of: scholarly article
title: Optimal distributed algorithms in unlabeled tori and chordal rings
zbMATH Open document ID: 0896.68064
author: Bernard Mans
published in: Journal of Parallel and Distributed Computing
publication date: 1998-10-01T00:00:00Z
Mathematics Subject Classification ID: 68W10
zbMATH DE Number: 1140532
zbMATH Keywords: message complexity
zbMATH Keywords: distributed algorithms
MaRDI profile type: Publication
OpenAlex ID: W2066274820
DOI: 10.1006/JPDC.1997.1389
Recommended article: Universally-optimal distributed algorithms for known topologies
Recommended article: Towards optimal distributed election on chordal rings
Recommended article: A near-optimal multistage distributed algorithm for finding leaders in clustered chordal rings
Recommended article: Distributed Approximation Algorithms in Unit-Disk Graphs
Recommended article: Round- and Message-Optimal Distributed Graph Algorithms
Recommended article: Optimal lower bounds for some distributed algorithms for a complete network of processors
Recommended article: Distributed Computing of Efficient Routing Schemes in Generalized Chordal Graphs
Recommended article: Distributed computing of efficient routing schemes in generalized chordal graphs
description: scientific article; zbMATH DE number 1140532