메뉴 건너뛰기




Volumn 2013, Issue , 2013, Pages

Analysis of average shortest-path length of scale-free network

Author keywords

[No Author keywords available]

Indexed keywords


EID: 84880885245     PISSN: 1110757X     EISSN: 16870042     Source Type: Journal    
DOI: 10.1155/2013/865643     Document Type: Article
Times cited : (53)

References (22)
  • 1
    • 0033539175 scopus 로고    scopus 로고
    • Diameter of the world-wide web
    • DOI 10.1038/43601
    • Albert R., Jeong H., Barabási A., Diameter of the world-wide web. Nature 1999 401 6749 130 131 2-s2.0-0033539175 10.1038/43601 (Pubitemid 29436307)
    • (1999) Nature , vol.401 , Issue.6749 , pp. 130-131
    • Albert, R.1    Jeong, H.2    Barabasi, A.-L.3
  • 2
    • 0038483826 scopus 로고    scopus 로고
    • Emergence of scaling in random networks
    • 2-s2.0-0038483826 10.1126/science.286.5439.509
    • Barabási A.-L., Albert R., Emergence of scaling in random networks. Science 1999 286 5439 509 512 2-s2.0-0038483826 10.1126/science.286. 5439.509
    • (1999) Science , vol.286 , Issue.5439 , pp. 509-512
    • Barabási, A.-L.1    Albert, R.2
  • 4
    • 0036013593 scopus 로고    scopus 로고
    • Statistical mechanics of complex networks
    • 2-s2.0-0036013593 10.1103/RevModPhys.74.47 ZBL1205.82086
    • Albert R., Barabási A., Statistical mechanics of complex networks. Reviews of Modern Physics 2002 74 1 47 97 2-s2.0-0036013593 10.1103/RevModPhys.74.47 ZBL1205.82086
    • (2002) Reviews of Modern Physics , vol.74 , Issue.1 , pp. 47-97
    • Albert, R.1    Barabási, A.2
  • 6
    • 0032482432 scopus 로고    scopus 로고
    • Collective dynamics of 'small-world' networks
    • DOI 10.1038/30918
    • Strogatz S. H., Watts D. J., Collective dynamics of 'small-world' networks. Nature 1998 393 6684 440 442 2-s2.0-0032482432 10.1038/30918 (Pubitemid 28292183)
    • (1998) Nature , vol.393 , Issue.6684 , pp. 440-442
    • Watts, D.J.1    Strogatz, S.H.2
  • 7
    • 34147120474 scopus 로고
    • A note on two problems in connexion with graphs
    • 2-s2.0-34147120474 10.1007/BF01386390 ZBL0092.16002
    • Dijkstra E. W., A note on two problems in connexion with graphs. Numerische Mathematik 1959 1 1 269 271 2-s2.0-34147120474 10.1007/BF01386390 ZBL0092.16002
    • (1959) Numerische Mathematik , vol.1 , Issue.1 , pp. 269-271
    • Dijkstra, E.W.1
  • 9
    • 84896773698 scopus 로고    scopus 로고
    • A parallelization of dijkstra's shortest path algorithm
    • Mathematical Foundations of Computer Science 1998
    • Crauser A., Mehlhorn K., Meyer U., Sanders P., A parallelization of Dijkstra's shortest path algorithm volume. Mathematical Foundations of Computer Science (MFCS) 1998 1450 722 731 Lecture Notes in Computer Science (Pubitemid 128119108)
    • (1998) Lecture Notes in Computer Science , Issue.1450 , pp. 722-731
    • Crauser, A.1    Mehlhorn, K.2    Meyer, U.3    Sanders, P.4
  • 10
    • 0242599131 scopus 로고    scopus 로고
    • A simple parallel algorithm for the single-source shortest path problem on planar digraphs
    • 2-s2.0-0242599131 10.1006/jpdc.2000.1646 ZBL0966.68230
    • Träff J. L., Zaroliagis C. D., A simple parallel algorithm for the single-source shortest path problem on planar digraphs. Journal of Parallel and Distributed Computing 2000 60 9 1103 1124 2-s2.0-0242599131 10.1006/jpdc.2000. 1646 ZBL0966.68230
    • (2000) Journal of Parallel and Distributed Computing , vol.60 , Issue.9 , pp. 1103-1124
    • Träff, J.L.1    Zaroliagis, C.D.2
  • 11
    • 34547953707 scopus 로고    scopus 로고
    • Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics (ALENEX '07) January 2007 New Orleans, La, USA 2-s2.0-34547953707
    • Madduri K., Bader D. A., Jonathan W. B., Crobak J. R., An experimental study of a parallel shortest path algorithm for solving large-scale graph instances. Proceedings of the 9th Workshop on Algorithm Engineering and Experiments and the 4th Workshop on Analytic Algorithms and Combinatorics (ALENEX '07) January 2007 New Orleans, La, USA 23 35 2-s2.0-34547953707
    • An Experimental Study of A Parallel Shortest Path Algorithm for Solving Large-scale Graph Instances , pp. 23-35
    • Madduri, K.1    Bader, D.A.2    Jonathan, W.B.3    Crobak, J.R.4
  • 13
    • 74549131087 scopus 로고    scopus 로고
    • Proceedings of the 18th International Conference on Information and Knowledge Management (CIKM '09) November 2009 2-s2.0-74549131087 10.1145/1645953.1646063
    • Potamias M., Bonchi F., Castillo C., Gionis A., Fast shortest path distance estimation in large networks. Proceedings of the 18th International Conference on Information and Knowledge Management (CIKM '09) November 2009 867 876 2-s2.0-74549131087 10.1145/1645953.1646063
    • Fast Shortest Path Distance Estimation in Large Networks , pp. 867-876
    • Potamias, M.1    Bonchi, F.2    Castillo, C.3    Gionis, A.4
  • 15
    • 84880867486 scopus 로고    scopus 로고
    • A new approximation algorithm for finding the shortest path in large networks
    • Su l., Zhang N., Ma L., A new approximation algorithm for finding the shortest path in large networks. Complex System and Complex Science 2008 5 2 51 54
    • (2008) Complex System and Complex Science , vol.5 , Issue.2 , pp. 51-54
    • Su, L.1    Zhang, N.2    Ma, L.3
  • 16
    • 0942276880 scopus 로고    scopus 로고
    • Complex networks: Small-world, scale-free and beyond
    • 2-s2.0-0942276880 10.1109/MCAS.2003.1228503
    • Wang X. F., Chen G., Complex networks: small-world, scale-free and beyond. IEEE Circuits and Systems Magazine 2003 3 1 6 20 2-s2.0-0942276880 10.1109/MCAS.2003.1228503
    • (2003) IEEE Circuits and Systems Magazine , vol.3 , Issue.1 , pp. 6-20
    • Wang, X.F.1    Chen, G.2
  • 18
    • 63349101264 scopus 로고    scopus 로고
    • Demonstration of complex network: CERNET
    • Zhang N., Demonstration of complex network: CERNET Journal of Systems Engineering 2006 21 4 337 340
    • (2006) Journal of Systems Engineering , vol.21 , Issue.4 , pp. 337-340
    • Zhang, N.1
  • 19
    • 84880877593 scopus 로고    scopus 로고
    • Analysis of china education network structure
    • Zhang N., Analysis of china education network structure Computer Engineering 2007 33 17 140 142
    • (2007) Computer Engineering , vol.33 , Issue.17 , pp. 140-142
    • Zhang, N.1
  • 22
    • 48549105196 scopus 로고    scopus 로고
    • Comparative studies on the topological structure of China Education Network
    • 2-s2.0-48549105196
    • Zhang N., Su L., Ma L., Comparative studies on the topological structure of China Education Network Journal of University of Shanghai for Science and Technology 2008 30 3 297 299 2-s2.0-48549105196
    • (2008) Journal of University of Shanghai for Science and Technology , vol.30 , Issue.3 , pp. 297-299
    • Zhang, N.1    Su, L.2    Ma, L.3


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.