Long paths in hypercubes with a quadratic number of faults

DOI10.1016/J.INS.2009.06.029zbMATH Open1193.68051OpenAlexW2076524741MaRDI QIDQ730952FDOQ730952

Václav Koubek, Tomáš Dvořák

Publication date: 1 October 2009

Published in: Information Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ins.2009.06.029

Recommendations

• Long paths and cycles in hypercubes with faulty vertices
• Long paths and cycles in faulty hypercubes: existence, optimality, complexity
• Long paths in hypercubes with conditional node-faults
• Longest fault-free paths in hypercubes with vertex faults
• Embedded paths and cycles in faulty hypercubes

zbMATH Keywords

hypercubelinear-time algorithmfaulty vertexlong path

Mathematics Subject Classification ID

Applications of graph theory (05C90) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Cites Work

• 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
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Longest fault-free paths in hypercubes with vertex faults
• Graphs, networks and algorithms
• Edge Multiplicity and Other Trace Functions
• Long paths and cycles in hypercubes with faulty vertices
• On Hamiltonian circuits and spanning trees of hypercubes
• Data compression and Gray-code sorting

Cited In (16)

• Paired many-to-many disjoint path covers of hypercubes with faulty edges
• Conditional edge-fault Hamiltonicity of augmented cubes
• Long cycles in hypercubes with optimal number of faulty vertices
• Edge-fault-tolerant panconnectivity and edge-pancyclicity of the complete graph
• Long paths in hypercubes with conditional node-faults
• Pancyclicity and bipancyclicity of conditional faulty folded hypercubes
• Longest fault-free paths in hypercubes with vertex faults
• Computational complexity of long paths and cycles in faulty hypercubes
• Rounds in combinatorial search
• On the maximum number of fault-free mutually independent Hamiltonian cycles in the faulty hypercube
• The 2-path-bipanconnectivity of hypercubes
• The panpositionable panconnectedness of augmented cubes
• Many-to-many disjoint paths in hypercubes with faulty vertices
• Long paths and cycles in hypercubes with faulty vertices
• Efficient Connectivity Testing of Hypercubic Networks with Faults
• Edge-fault-tolerant diameter and bipanconnectivity of hypercubes

This page was built for publication: Long paths in hypercubes with a quadratic number of faults

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q730952)