Constructing the nearly shortest path in crossed cubes

DOI10.1016/J.INS.2009.02.018MaRDI QIDQ2390375zbMATHOpenAlexFDO

Authors Pao-Lien Lai, Hong-Chun Hsu

Publication date 22 July 2009

Published in Information Sciences (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.ins.2009.02.018

zbMATH Keywords

interconnection networkspath embeddingcrossed cubesnearly shortest pathsecond shortest path

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Network design and communication in computer systems (68M10)

Recommendations

• On the path-connectivity, vertex-pancyclicity, and edge-pancyclicity of crossed cubes
• Optimizing Hamiltonian panconnectedness for the crossed cube architecture
• Fault-tolerant embedding of paths in crossed cubes
• Paths in Möbius cubes and crossed cubes
• Complete path embeddings in crossed cubes

Cites work

• scientific article; zbMATH DE number 52113 (Why is no real title available?)
• scientific article; zbMATH DE number 1083040 (Why is no real title available?)
• 3-Connected line graphs of triangular graphs are panconnected and 1-hamiltonian
• Complete path embeddings in crossed cubes
• Connected, locally 2-connected,K1,3-free graphs are panconnected
• Edge-pancyclicity and path-embeddability of bijective connection graphs
• Embedding binary trees into crossed cubes
• Finding the k Shortest Paths
• Letter to the Editor—The kth Best Route Through a Network
• Multiply-twisted hypercube with five or more dimensions is not vertex-transitive
• Node-pancyclicity and edge-pancyclicity of crossed cubes
• On the double-vertex-cycle-connectivity of crossed cubes
• Panconnectivity of locally connected claw-free graphs
• Paths in Möbius cubes and crossed cubes

Cited in

(12)

• Independent spanning trees in crossed cubes
• Distance and Short Parallel Paths in Augmented Cubes
• Two-node-Hamiltonicity of enhanced pyramid networks
• An equivalent definition of the crossed cube
• Matching preclusion and conditional matching preclusion for crossed cubes
• Optimizing Hamiltonian panconnectedness for the crossed cube architecture
• Embedding meshes/tori in faulty crossed cubes
• The triangular pyramid: Routing and topological properties
• Paths in Möbius cubes and crossed cubes
• Conditional edge-fault Hamiltonicity of augmented cubes
• Constructing edge-disjoint spanning trees in twisted cubes
• A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube

This page was built for publication: Constructing the nearly shortest path in crossed cubes

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390375)