Distributed maximum maintenance on hierarchically divided graphs

DOI10.1007/BF01211315zbMath0768.68025OpenAlexW2087401254MaRDI QIDQ2366165

P. J. A. Lentfert, S. Doaitse Swierstra

Publication date: 29 June 1993

Published in: Formal Aspects of Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01211315

zbMATH Keywords

distributed algorithmUNITYconcurrent algorithmsdivision treehierarchically divided network

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Distributed algorithms (68W15)

Uses Software

• UNITY

Cites Work

• Unnamed Item
• Eliminating the substitution axiom from UNITY logic
• The formal specification and design of a distributed electronic funds-transfer system

This page was built for publication: Distributed maximum maintenance on hierarchically divided graphs