Computational complexity of long paths and cycles in faulty hypercubes
From MaRDI portal
Publication:708231
DOI10.1016/J.TCS.2010.07.001zbMATH Open1207.68038OpenAlexW2057341189MaRDI QIDQ708231FDOQ708231
Publication date: 11 October 2010
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.07.001
Recommendations
- Long paths and cycles in faulty hypercubes: existence, optimality, complexity
- Long paths in hypercubes with a quadratic number of faults
- Long paths and cycles in hypercubes with faulty vertices
- Embedded paths and cycles in faulty hypercubes
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
Data encryption (aspects in computer science) (68P25) Network design and communication in computer systems (68M10)
Cites Work
- Title not available (Why is that?)
- Long paths in hypercubes with conditional node-faults
- Hyper-Hamilton laceable and caterpillar-spannable product graphs
- Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
- Fault-tolerant cycle embedding in the hypercube
- Title not available (Why is that?)
- Hamiltonian Cycles with Prescribed Edges in Hypercubes
- Longest fault-free paths in hypercubes with vertex faults
- On the Existence of Hamiltonian Circuits in Faulty Hypercubes
- Embedded paths and cycles in faulty hypercubes
- Long paths and cycles in hypercubes with faulty vertices
- Long paths in hypercubes with a quadratic number of faults
- Title not available (Why is that?)
Cited In (8)
- Long cycles in hypercubes with optimal number of faulty vertices
- Hamiltonian laceability in hypercubes with faulty edges
- Longest fault-free paths in hypercubes with vertex faults
- Gray codes with bounded weights
- On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
- Generalized Gray codes with prescribed ends
- Embedded paths and cycles in faulty hypercubes
- Efficient Connectivity Testing of Hypercubic Networks with Faults
This page was built for publication: Computational complexity of long paths and cycles in faulty hypercubes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708231)
