A derivation of distributed implementation of Warshall's algorithm
type: Item
instance of: scholarly article
title: A derivation of distributed implementation of Warshall's algorithm
zbMATH Open document ID: 0592.68065
DOI: 10.1016/0167-6423(86)90005-5
author: Jan L. A. van de Snepscheut
published in: Science of Computer Programming
publication date: 1986-01-01T00:00:00Z
Mathematics Subject Classification ID: 68R99
Mathematics Subject Classification ID: 03E20
Mathematics Subject Classification ID: 03-04
zbMATH DE Number: 3952031
zbMATH Keywords: transitive closure of a binary relation
MaRDI profile type: Publication
full work available at URL: 0167-6423(86)90005-5
OpenAlex ID: W2037144457
Recommended article: Some distributed algorithms revisited
Recommended article: Distributed algorithms. An intuitive approach
Recommended article: Q3787481
Recommended article: Efficient distributed algorithms by using the archimedean time assumption
Recommended article: On distributed algorithms in a broadcast domain
Recommended article: An ASM-Characterization of a Class of Distributed Algorithms
Recommended article: Distributed Bernstein-Vazirani algorithm
Recommended article: Q3126969
Recommended article: Some algorithms for comparing partial solutions in distributed systems
description: scientific article; zbMATH DE number 3952031