๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Optimal ranking in networks with community structure

โœ Scribed by Huafeng Xie; Koon-Kiu Yan; Sergei Maslov

Publisher
Elsevier Science
Year
2007
Tongue
English
Weight
228 KB
Volume
373
Category
Article
ISSN
0378-4371

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Optimal routings in communication networ
Optimal routings in communication networks with linearly bounded forwarding index
โœ Manoussakis, Yannis; Tuza, Zsolt ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 358 KB ๐Ÿ‘ 1 views

In a given graph with n vertices, a routing is defined as a set of n(n -1) routes, one route connecting each ordered pair of vertices. The load of a vertex is the number of routes going through it. The forwarding index of the graph is the minimum of the largest load taken over all routings. We const

Optimal Communication Algorithms in Dist
Optimal Communication Algorithms in Distributed Loop Networks
โœ R.K. Das; B.P. Sinha ๐Ÿ“‚ Article ๐Ÿ“… 1995 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 500 KB

Time optimal algorithms for multiple node broadcast and single node scatter in distributed loop networks have been proposed in this paper. These algorithms involve the minimum number of packet transmissions to effect both multiple node broadcast and single node scatter. O 1995 Academic Press, Inc.

Optimized network structure and routing
Optimized network structure and routing metric in wireless multihop ad hoc communication
โœ Wolfram Krause; Jan Scholz; Martin Greiner ๐Ÿ“‚ Article ๐Ÿ“… 2006 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 578 KB

Inspired by the Statistical Physics of complex networks, wireless multihop ad hoc communication networks are considered in abstracted form. Since such engineered networks are able to modify their structure via topology control, we search for optimized network structures, which maximize the end-to-en