scientific article; zbMATH DE number 3896838

zbMATH Open0562.94022MaRDI QIDQ3676066FDOQ3676066

Authors: Grant A. Cheston 

Publication date: 1984

Title of this publication is not available (Why is that?)

Recommendations

• An efficient distributed algorithm for centering a spanning tree of a biconnected graph
• Distributed algorithms for finding centers and medians in networks
• Centering a spanning tree of a biconnected graph
• scientific article; zbMATH DE number 4058884
• An algorithm for the minimum spanning tree with a pivotal point in directed networks

zbMATH Keywords

networkalgorithmspanning treelinear timemessage passinginformation accumulationbiconnected graphreceiving

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Applications of graph theory to circuits and networks (94C15)

Cited In (2)

• Centering a spanning tree of a biconnected graph
• An efficient distributed algorithm for centering a spanning tree of a biconnected graph

This page was built for publication:

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