𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Geometry of minimum spanning trees on scale-free networks

✍ Scribed by Gábor J. Szabó; Mikko Alava; János Kertész

Publisher
Elsevier Science
Year
2003
Tongue
English
Weight
199 KB
Volume
330
Category
Article
ISSN
0378-4371

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On finding a minimum spanning tree in a
On finding a minimum spanning tree in a network with random weights
✍ Colin McDiarmid; Theodore Johnson; Harold S. Stone 📂 Article 📅 2000 🏛 John Wiley and Sons 🌐 English ⚖ 221 KB 👁 2 views

We investigate Prim's standard ''tree-growing'' method for finding a minimum spanning tree, when applied to a network in which all degrees are about d and the edges e Ž . have independent identically distributed random weights w e . We find that when the kth ' Ž . edge e is added to the current tree

A distributed algorithm for constructing
A distributed algorithm for constructing minimum delay spanning trees under bandwidth constraints on overlay networks
✍ Thilmee M. Baduge; Akihito Hiromori; Hirozumi Yamaguchi; Teruo Higashino 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 787 KB

## Abstract In this paper, we propose a new protocol that constructs a spanning tree on an overlay network given by a complete graph, in a decentralized manner. This algorithm consists of two decentralized operations, which support joining of and leaving of the overlay network at any time in the se

On the utility of scale-free networks
On the utility of scale-free networks
✍ Vic Norris; Derek Raine 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 50 KB 👁 2 views

In her provocative (and informative) article on recent research into power laws in biology, Evelyn Fox Keller implies that this work has not led to research that is self-generating and, above all, that it has not produced significant insights. A refutation of this particular criticism might be base