✦ LIBER ✦

Method of Partition of Networks with Fixed Degrees of Nodes and Network Flows 44

✍ Scribed by A. A. Mironov; P. S. Selin

Book ID: 121527202
Publisher: SP MAIK Nauka/Interperiodica
Year: 2005
Tongue: English
Weight: 515 KB
Volume: 44
Category: Article
ISSN: 1064-2307
DOI: 10.1134/S1064230705060079

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Degree correlations in growing networks

Degree correlations in growing networks with deletion of nodes

✍ Josep L. Garcia-Domingo; David Juher; Joan Saldaña 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 1019 KB

Dependence of the average to-node distan

Dependence of the average to-node distance on the node degree for random graphs and growing networks

✍ K. Malarz; K. Kułakowski 📂 Article 📅 2004 🏛 Springer 🌐 English ⚖ 181 KB

Reliability of a stochastic-flow network

Reliability of a stochastic-flow network with unreliable branches & nodes, under budget constraints

✍ Yi-Kuei Lin 📂 Article 📅 2004 🏛 IEEE 🌐 English ⚖ 236 KB

A fast network partition method for larg

A fast network partition method for large-scale urban traffic networks

✍ Zhao Zhou, Shu Lin, Yugeng Xi 📂 Article 📅 2013 🏛 South China University of Technology and Academy o 🌐 English ⚖ 308 KB

Symbolic analysis of linear networks usi

Symbolic analysis of linear networks using matrix partition method and FFT algorithm

✍ Hideo Takamura; Yuzo Ohta; Tadashi Matsumoto 📂 Article 📅 1982 🏛 John Wiley and Sons 🌐 English ⚖ 582 KB

Constructions of large planar networks w

Constructions of large planar networks with given degree and diameter

✍ Fellows, M.; Hell, P.; Seyffarth, K. 📂 Article 📅 1998 🏛 John Wiley and Sons 🌐 English ⚖ 157 KB 👁 3 views

There is considerable interest in constructing large networks with given diameter and maximum degree. In certain applications, there is a natural restriction for the networks to be planar. Thus, consider the problem of determining the maximum number of nodes in a planar network with maximum degree D