Constructing the nearly shortest path in crossed cubes

DOI10.1016/J.INS.2009.02.018zbMATH Open1205.68264OpenAlexW1996374919MaRDI QIDQ2390375FDOQ2390375

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

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

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)

Cites Work

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

Cited In (11)

• MATCHING PRECLUSION AND CONDITIONAL MATCHING PRECLUSION FOR CROSSED CUBES
• Conditional edge-fault Hamiltonicity of augmented cubes
• Independent spanning trees in crossed cubes
• Distance and Short Parallel Paths in Augmented Cubes
• Constructing edge-disjoint spanning trees in twisted cubes
• The triangular pyramid: Routing and topological properties
• Paths in Möbius cubes and crossed cubes
• A dynamic programming algorithm for simulation of a multi-dimensional torus in a crossed cube
• An equivalent definition of the crossed cube
• Embedding meshes/tori in faulty crossed cubes
• Two-node-Hamiltonicity of enhanced pyramid networks

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)