Distributed maximum maintenance on hierarchically divided graphs

DOI10.1007/BF01211315MaRDI QIDQ2366165zbMATH OpenOpenAlexFDO

Authors 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

concurrent algorithmsdistributed algorithmdivision treehierarchically divided networkUNITY

Mathematics Subject Classification ID

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

Recommendations

• Distributed algorithms for maximum cliques
• Distributed submodular maximization
• An efficient distributed algorithm for maximum matching in general graphs
• Distributed MST for constant diameter graphs
• Distributed MST for constant diameter graphs
• Distributed CSPs by graph partitioning
• Distributed local approximation algorithms for maximum matching in graphs and hypergraphs
• On the distributed complexity of computing maximal matchings
• scientific article; zbMATH DE number 1303560
• Lower Bounds for Distributed Maximum-Finding Algorithms

Cites work

• Eliminating the substitution axiom from UNITY logic
• scientific article; zbMATH DE number 194539 (Why is no real title available?)
• The formal specification and design of a distributed electronic funds-transfer system

Describes a project that uses

Uses Software

• UNITY

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2366165)