A new approach to shortest paths on networks based on the quantum bosonic mechanism

New Journal of Physics

Volumn 13, Issue , 2011, Pages

  Jiang, Xin ^a   Wang, Hailong ^a   Tang, Shaoting ^a   Ma, Lili ^a   Zhang, Zhanli ^a,b   Zheng, Zhiming ^a,b  

^a BEIHANG UNIVERSITY   (China)

^b PEKING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALL PAIRS SHORTEST PATHS; ANDERSONS; BOSONIC SYSTEMS; COMBINATORICS; GLOBAL STRUCTURE; GRAPH ALGORITHMS; GREEDY ROUTING; GREEN FUNCTION; LOCAL SEARCH; NETWORK STRUCTURES; NEW APPROACHES; OPTICAL COMMUNICATION NETWORKS; QUANTUM DYNAMICS; SCALE FREE NETWORKS; SHORTEST PATH;

ALGORITHMS; GRAPH THEORY; OPTICAL COMMUNICATION; QUANTUM THEORY;

WIRELESS SENSOR NETWORKS;

EID: 79251554082     PISSN: 13672630     EISSN: None     Source Type: Journal    
DOI: 10.1088/1367-2630/13/1/013022     Document Type: Article

References (25)

1. Dijkstra E W 1959 A note on two problems in connexion with graphs Numer. Math. 1 269-71
2. Cormen T H, Leiserson C E, Rivest R L and Stein C 2001 Introduction to Algorithms (Cambridge, MA: MIT Press)
3. Goldberg A V 1995 Scaling algorithms for the shortest paths problem SIAM J. Comput. 24 494-504
4. Zwick U 2002 All pairs shortest paths using bridging sets and rectangular matrix multiplication J. ACM 49 289-317
5. Thorup M 2003 Integer priority queues with decrease key in constant time and the single source shortest paths problem 35th Annu. ACM Symp. on Theory of Computers pp 149-58
6. Pettie S 2004 A new approach to all-pairs shortest paths on real-weighted graphs Theor. Comput. Sci. 312 47-74
7. Pettie S and Ramachandran V 2005 A shortest path algorithm for real-weighted undirected graphs SIAM J. Comput. 34 6 1398-431
8. Chan T M 2007 More algorithms for all-pairs shortest paths in weighted graphs Proc. 39th Annu. ACM Symp. on Theory of Computing pp 590-8
9. Seidel R 1995 On the All-pairs-shortest-path problem in unweighted undirected graphs J. Comput. Syst. Sci. 51 400
10. Shoshan A and Zwick U 1999 All pairs shortest paths in undirected graphs with integer weights Proc. 36th Annu. Symp. on Foundations of Computer Science pp 605-15
11. Albert R and Barabási A-L 2002 Statistical mechanics of complex networks Rev. Mod. Phys. 74 47
12. Newman M E J 2003 The structure and function of complex networks SIAM Rev. 45 167
13. Dorogovtsev S N, Goltsev A V and Mendes J F 2008 Critical phenomena in complex networks Rev. Mod. Phys. 80 1275
14. Boguñá M, Krioukov D and Claffy K C 2009 Navigability of complex networks Nat. Phys. 5 74
15. Kleinberg J M 2000 Navigation in a small world Nature 406 845
16. Fraigniaud P, Gavoille C, Kosowski A, Lebhar E and Lotker Z 2007 Universal augmentation schemes for network navigability: overcoming the √n-barrier 19th Annu. ACM Symp. on Parallelism in Algorithms and Architectures (San Diego, CA, 9-11 June 2007)
17. Serrano M A, Krioukov D and Boguñá M 2008 Self-similarity of complex networks and hidden metric spaces Phys. Rev. Lett. 100 078701
18. Huston G 2001 Scaling inter-domain routing-a view forward Int. Protocol J. 4 2-16
19. Jiang X, Wang H L, Tang S T, Zhang Z L, Ma L L, Tian G S and Zheng Z M 2010 Detecting the structure of complex networks by quantum bosonic dynamics Physica A 389 2465-71
20. Cohen R and Havlin S 2003 Scale-free networks are ultrasmall Phys. Rev. Lett. 90 058701
21. Boguñá M and Krioukov D 2009 Navigating ultrasmall worlds in ultrashort time Phys. Rev. Lett. 102 058701
22. Batagelj V and Mrvar A 2006 Pajek datasets http://vlado.fmf.uni-lj.si/ pub/networks/data
23. Duch J and Arenas A 2005 Community detection in complex networks using extremal optimization Phys. Rev. E 72 027104
24. Bu D et al 2003 Topological structure analysis of the protein-protein interaction network in budding yeast Nucleic Acids Res. 31 92443-50
25. Jahnke L, Kantelhardt J W, Berkovits R and Havlin S 2008 Wave localization in complex networks with high clustering Phys. Rev. Lett. 101 175702