Geometry of minimum spanning trees on scale-free networks

Physica A: Statistical Mechanics and its Applications

Volumn 330, Issue 1-2, 2003, Pages 31-36

  Szabó, Gábor J ^a   Alava, Mikko ^b   Kertész, János ^a  

^a BUDAPEST UNIVERSITY OF TECHNOLOGY AND ECONOMICS   (Hungary)

^b AALTO UNIVERSITY   (Finland)

Author keywords

Global optimization; Minimum spanning trees; Random networks

Indexed keywords

COMPUTATIONAL GEOMETRY; GRAPH THEORY; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

SPANNING TREES;

TREES (MATHEMATICS);

EID: 0344550311     PISSN: 03784371     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.physa.2003.08.031     Document Type: Conference Paper

References (7)

1. Barabási A.-L. Phys. Rev. Lett. 76:1996;3750.
2. Dobrin R., Duxbury P.M. Phys. Rev. Lett. 86:2001;5076.
3. Noh J.-D., Rieger H. Phys. Rev. E. 66:2002;066 127.
4. Cormen T.H., Leiserson C.E., Rivest R.L., Stein C. Introduction to Algorithms. 2nd Edition:2001;MIT Press, Cambridge.
5. Broder A.Z., Mayr E.W. J. Algorithms. 24(1):1997;171.
6. Wright P. Bull. Inst. Combin. Appl. 21:1997;65.
7. D.-H. Kim, H. Jeong, Private communication and poster at the Santa Fe conference on networks, May 2003.