𝔖 Bobbio Scriptorium
✦   LIBER   ✦

An algorithm finding p-medians of a graph

✍ Scribed by S. A. Gorunovich

Book ID
105059756
Publisher
Springer US
Year
1986
Tongue
English
Weight
455 KB
Volume
21
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

A Self-Stabilizing Distributed Algorithm
A Self-Stabilizing Distributed Algorithm to Find the Median of a Tree Graph
✍ Gheorghe Antonoiu; Pradip K. Srimani πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 231 KB

We propose a self-stabilizing algorithm (protocol) for computing the median in a given tree graph. We show the correctness of the proposed algorithm by using a new technique involving induction.

An algorithm for finding factorizations
An algorithm for finding factorizations of complete graphs
✍ A. J. W. Hilton; Matthew Johnson πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 58 KB πŸ‘ 1 views

## Abstract We show how to find a decomposition of the edge set of the complete graph into regular factors where the degree and edge‐connectivity of each factor is prescribed. Β© 2003 Wiley Periodicals, Inc. J Graph Theory 43: 132–136, 2003