𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Asymptotic approach to the problem of k-median of a graph

✍ Scribed by V. A. Emelichev; N. E. Efimchik

Publisher
Springer US
Year
1994
Tongue
English
Weight
342 KB
Volume
30
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 asymptotic approach to the problem of
An asymptotic approach to the problem of the free oscillations of a beam
✍ G.V. Kostin; V.V. Saurin πŸ“‚ Article πŸ“… 2007 πŸ› Elsevier Science 🌐 English βš– 358 KB

Equations describing the free small longitudinal and transverse oscillations of a straight elastic beam of rectangular cross section are obtained using the plane linear theory of elasticity and the method of integrodifferential relations. The initial system of partial differential equations is reduc

An asymptotic-numerical approach to the
An asymptotic-numerical approach to the coronal loop problem
✍ F. Verhulst; P. A. Zegeling πŸ“‚ Article πŸ“… 1990 πŸ› John Wiley and Sons 🌐 English βš– 331 KB

## Abstract The coronal loop problem is characterized by mixed boundary conditions and the loop length condition, which is global. Using singular perturbation methods one can identify and construct two boundary layers at the base of the loop. Extending this to a combined asymptotic‐numerical treat

The w-median of a connected strongly cho
The w-median of a connected strongly chordal graph
✍ Hai-Yen Lee; Gerard J. Chang πŸ“‚ Article πŸ“… 1994 πŸ› John Wiley and Sons 🌐 English βš– 337 KB πŸ‘ 1 views

## Abstract Suppose __G = (V, E)__ is a graph in which every vertex __x__ has a non‐negative real number __w(x)__ as its weight. The __w__‐distance sum of a vertex __y__ is __D~G, w~(y)__ = Οƒ~xβ‰…v~ __d(y, x)w(x).__ The __w__‐median of __G__ is the set of all vertices __y__ with minimum __w__‐distanc