𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The cost of monotonicity in distributed graph searching

✍ Scribed by David Ilcinkas; Nicolas Nisse; David Soguet

Publisher
Springer-Verlag
Year
2009
Tongue
English
Weight
923 KB
Volume
22
Category
Article
ISSN
0178-2770

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Monotonicity in graph searching
Monotonicity in graph searching
✍ D Bienstock; Paul Seymour πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 381 KB
Moments of graphs in monotone families
Moments of graphs in monotone families
✍ ZoltΓ‘n FΓΌredi; AndrΓ© KΓΌndgen πŸ“‚ Article πŸ“… 2005 πŸ› John Wiley and Sons 🌐 English βš– 114 KB

## Abstract The __k__th __moment__ of the degree sequence __d__~1~ β‰₯ __d__~2~ β‰₯ …__d__~n~ of a graph __G__ is $\mu \_k(G)={1\over n}{\sum}{d\_i^k}$. We give asymptotically sharp bounds for ΞΌ~k~(__G__) when __G__ is in a monotone family. We use these results for the case __k__ = 2 to improve a resul

The Irregularity Cost of a Graph
The Irregularity Cost of a Graph
✍ F. Harary; O.R. Oellermann πŸ“‚ Article πŸ“… 1997 πŸ› Elsevier Science 🌐 English βš– 627 KB

A Multigraph His irregular if no two of its nodeahavethe samedegree.It hasbeen shownthat a graphis the underlying graphof some irregularMultigraph if and only if it has at most one trivialcomponentand no componentsof order2. We definethe irregularity cost of such a graph G to be the minimumnumberof

On the distribution of search cost for t
On the distribution of search cost for the move-to-front rule
✍ James Allen Fill; Lars Holst πŸ“‚ Article πŸ“… 1996 πŸ› John Wiley and Sons 🌐 English βš– 393 KB πŸ‘ 1 views

A file of records, each with an associated request probability, is dynamically maintained as a serial list. Successive requests are mutually independent. The list is reordered according to the move-to-front (MTF) rule: The requested record is moved to the front of the list. We derive the stationary