Constructing the nearly shortest path in crossed cubes

DOI10.1016/j.ins.2009.02.018zbMath1205.68264OpenAlexW1996374919MaRDI QIDQ2390375

Hong-Chun Hsu, Pao-Lien Lai

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

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

Related Items (8)

Constructing edge-disjoint spanning trees in twisted cubes ⋮ A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube ⋮ The triangular pyramid: Routing and topological properties ⋮ Two-node-Hamiltonicity of enhanced pyramid networks ⋮ Conditional edge-fault Hamiltonicity of augmented cubes ⋮ Independent spanning trees in crossed cubes ⋮ Embedding meshes/tori in faulty crossed cubes ⋮ MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES

Cites Work

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

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