Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
DOI10.1007/S00224-008-9108-ZzbMATH Open1187.68344OpenAlexW2017861455MaRDI QIDQ733731FDOQ733731
Authors: Sun-Yuan Hsieh, Yu-Fen Weng 
Publication date: 19 October 2009
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-008-9108-z
Recommendations
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- On the mutually independent Hamiltonian cycles in faulty hypercubes
- Hamiltonian laceability in hypercubes with faulty edges
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
Hamiltonianhypercubesgraph-theoretic interconnection networksfault-tolerant embeddingpairwise independent Hamiltonian paths
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Cites Work
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Embedding Hamiltonian cycles into folded hypercubes with faulty links
- Generalized Hypercube and Hyperbus Structures for a Computer Network
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Linear array and ring embeddings in conditional faulty hypercubes
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Hamiltonian-laceability of star graphs
- A dual-Hamiltonian-path-based multicasting strategy for wormhole-routed star graph interconnection networks.
- Title not available (Why is that?)
- Embedding cube-connected cycles graphs into faulty hypercubes
- Embedding longest fault-free paths onto star graphs with more vertex faults
- Longest fault-free paths in star graphs with vertex faults
- Title not available (Why is that?)
Cited In (22)
- Two spanning disjoint paths with required length in generalized hypercubes
- Fault-free Hamiltonian paths passing through prescribed linear forests in balanced hypercubes with faulty links
- Paired many-to-many disjoint path covers in faulty hypercubes
- Independent spanning trees on twisted cubes
- Fault-tolerant Hamiltonian laceability of Cayley graphs generated by transposition trees
- Embeddings of Hamiltonian paths in faulty \(k\)-ary 2-cubes
- Hamiltonian decomposition of generalized recursive circulant graphs
- Mutually independent bipanconnected property of hypercube
- Diameter variability of hypercubes
- On the mutually independent Hamiltonian cycles in faulty hypercubes
- Mutually independent Hamiltonian cycles of binary wrapped butterfly graphs
- Embedding multidimensional grids into optimal hypercubes
- Modelling simultaneous broadcasting by level-disjoint partitions
- Fault-free mutually independent Hamiltonian cycles in hypercubes with faulty edges
- A Fault-Free Unicast Algorithm in the Generalized Hypercube with Restricted Faulty Vertices
- Fault-tolerant Hamiltonian laceability of hypercubes.
- Hamiltonian cycles and paths in hypercubes with disjoint faulty edges
- Edge-fault-tolerant strong Menger edge connectivity of bubble-sort star graphs
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- Two conditions for reducing the maximal length of node-disjoint paths in hypercubes
- Rooted level-disjoint partitions of Cartesian products
- Many-to-many disjoint paths in hypercubes with faulty vertices
This page was built for publication: Fault-tolerant embedding of pairwise independent Hamiltonian paths on a faulty hypercube with edge faults
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q733731)
