Algorithms and Computation

DOI10.1007/11602613zbMath1175.68291OpenAlexW2304246803MaRDI QIDQ5897940

Xiaola Lin, Rynson W. H. Lau, Jianxi Fan, Xiao-Hua Jia

Publication date: 14 November 2006

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11602613

Mathematics Subject Classification ID

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

Related Items (16)

On the \(t/k\)-diagnosability of BC networks ⋮ Paths and cycles identifying vertices in twisted cubes ⋮ Node-pancyclicity and edge-pancyclicity of hypercube variants ⋮ Embedding complete multi-partite graphs into Cartesian product of paths and cycles ⋮ Panconnectivity and pancyclicity of hypercube-like interconnection networks with faulty elements ⋮ An algorithm to construct independent spanning trees on parity cubes ⋮ Connectivity and constructive algorithms of disjoint paths in dragonfly networks ⋮ Optimal embedding of hypercube into cylinder ⋮ Two-disjoint-cycle-cover vertex pancyclicity of augmented cubes ⋮ Geodesic pancyclicity of twisted cubes ⋮ Vertex-pancyclicity of twisted cubes with maximal faulty edges ⋮ Panconnectivity and edge-pancyclicity of faulty recursive circulant \(G(2^m,4)\) ⋮ Fault-free Hamiltonian cycles passing through a prescribed linear forest in 3-ary \(n\)-cube with faulty edges ⋮ Vertex-pancyclicity of augmented cubes with maximal faulty edges ⋮ Survey on path and cycle embedding in some networks ⋮ Structure fault tolerance of WK-recursive networks

This page was built for publication: Algorithms and Computation