𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A tight axiomatization of the median procedure on median graphs

✍ Scribed by Mulder, Henry Martyn; Novick, Beth

Book ID
122775875
Publisher
Elsevier Science
Year
2013
Tongue
English
Weight
270 KB
Volume
161
Category
Article
ISSN
0166-218X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

On the -median polytope of -free graphs
On the -median polytope of -free graphs
✍ Mourad BaΓ―ou; Francisco Barahona πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 533 KB
On the geodetic number of median graphs
On the geodetic number of median graphs
✍ BoΕ‘tjan BreΕ‘ar; Aleksandra Tepeh Horvat πŸ“‚ Article πŸ“… 2008 πŸ› Elsevier Science 🌐 English βš– 174 KB
The location of median paths on grid gra
The location of median paths on grid graphs
✍ Ronald I. Becker; Isabella Lari; Andrea Scozzari; Giovanni Storchi πŸ“‚ Article πŸ“… 2007 πŸ› Springer US 🌐 English βš– 341 KB
The backup 2-median problem on block gra
The backup 2-median problem on block graphs
✍ Cheng, Yu-kun; Kang, Li-ying; Yan, Hong πŸ“‚ Article πŸ“… 2014 πŸ› Institute of Applied Mathematics, Chinese Academy 🌐 English βš– 278 KB
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