Construction of optimal communication structures for weighted distributed match-making

DOI10.1016/0169-7552(93)90020-5MaRDI QIDQ4272444zbMATH OpenOpenAlexFDO

Authors Amane Nakajima

Publication date 17 February 1994

Published in Computer Networks and ISDN Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0169-7552(93)90020-5

zbMATH Keywords

communication complexitycommunication structuredistributed match-makingdistributed name service

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• A note on weighted distributed match-making
• The Steiner problem in distributed computing systems
• scientific article; zbMATH DE number 4062556
• Distributed match-making
• Distributed Weighted Matching

Cited in

(2)

• scientific article; zbMATH DE number 4062556 (Why is no real title available?)
• A note on weighted distributed match-making

This page was built for publication: Construction of optimal communication structures for weighted distributed match-making

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