Constructing the nearly shortest path in crossed cubes

Information Sciences

Volumn 179, Issue 14, 2009, Pages 2487-2493

  Lai, Pao Lien ^a   Hsu, Hong Chun ^b  

^a NATIONAL DONG HWA UNIVERSITY   (Taiwan)

^b TZU CHI UNIVERSITY   (Taiwan)

Author keywords

Crossed cubes; Interconnection networks; Nearly shortest path; Path embedding; Second shortest path

Indexed keywords

CONSTRUCTION SCHEMES; CROSSED CUBES; EMBEDDINGS; GRAPH G; NEARLY SHORTEST PATH; OPTIMAL PATHS; PATH EMBEDDING; SECOND SHORTEST PATH; SUFFICIENT CONDITIONS;

GEOMETRY; INTERCONNECTION NETWORKS; LUTETIUM; MOLYBDENUM;

WIRELESS SENSOR NETWORKS;

EID: 67349114903     PISSN: 00200255     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.ins.2009.02.018     Document Type: Article

References (21)

1. Abuelrub E., and Bettayeb S. Embedding rings into faulty twisted hypercubes. J. Comput. Artif. Intel. 16 4 (1997) 425-441
2. Akl S.G. Parallel Computation: Models and Methods (1997), Prentice-Hall, NJ
3. Broersma H.J., and Veldman H.J. 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian. J. Graph Theory 11 (1987) 399-407
4. Chang C.P., Sung T.Y., and Hsu L.H. Edge congestion and topological properties of crossed cubes. IEEE Trans. Parall. Distrib. Syst. 11 1 (2000) 64-80
5. Efe K. A variation on the hypercube with lower diameter. IEEE Trans. Comput. 40 11 (1991) 1312-1316
6. Efe K. The crossed cube architecture for parallel computing. IEEE Trans. Parall. Distrib. Syst. 3 5 (1992) 513-524
7. Eppstein D. Finding the k shortest paths. SIAM J. Comput. 28 2 (1999) 652V-673V
8. Fan J., Lin X., and Jia X. Optimal path embedding in crossed cubes. IEEE Trans. Parall. Distrib. Syst. 16 2 (2005) 1190-1200
9. Fan J., Lin X., and Jia X. Node-pancyclicity and edge-pancyclicity of crossed cubes. Inform. Proc. Lett. 93 3 (2005) 133-138
10. Fan J., Jia X., and Lin X. Complete path embeddings in crossed cubes. Inform. Sci. 176 22 (2006) 3332-3346
11. Fan J., and Jia X. Edge-pancyclicity and path-embeddability of bijective connection graphs. Inform. Sci. 178 2 (2008) 340-351
12. Hsu L.H., and Lin C.K. Graph Theory And Interconnection Networks (2008), CRC PR Inc.
13. 1, 3-free graphs are panconnected. J. Graph Theory 8 (1984) 347-353
14. Kulasinghe P., and Bettayeb S. Embedding binary trees into crossed cubes. IEEE Trans. Comput. 44 7 (1995) 923-929
15. Kulasinghe P., and Bettayeb S. Multiply-twisted hypercube with five or more dimensions is not vertex-transitive. Inform. Proc. Lett. 53 1 (1995) 33-36
16. Leighton F.T. Introduction to Parallel Algorithms and Architecture: Arrays, Trees, Hypercubes (1992), Morgan Kaufmann, San Mateo
17. P.L. Lai, J.W. Hsue, J.M. Tan, L.H. Hsu, On the panconnected properties of the augmented cubes, in: Proceedings of the 2004 International Computer Symposium, 2004, pp. 1249-1251.
18. Pollack M. The kth best route through a network. Oper. Res. 9 (1961) 578
19. Seng Y., Tian F., and Wei B. Panconnectivity of locally connected claw-free graphs. Discrete Math. 203 (1999) 253-260
20. Xu J.M., Ma M.J., and Lu M. Paths in Möbius cubes and crossed cubes. Inform. Proc. Lett. 97 3 (2006) 94-97
21. Yang X.F., and Megson G.M. On the double-vertex-cycle-connectivity of crossed cubes. Parall. Algorithms Appl. 19 (2004) 11-17