Long paths in hypercubes with a quadratic number of faults
type: Item
instance of: scholarly article
title: Long paths in hypercubes with a quadratic number of faults
zbMATH Open document ID: 1193.68051
author: Tomáš Dvořák
author: Václav Koubek
published in: Information Sciences
publication date: 2009-10-01T00:00:00Z
Mathematics Subject Classification ID: 68M15
Mathematics Subject Classification ID: 05C90
zbMATH DE Number: 5610286
zbMATH Keywords: faulty vertex
zbMATH Keywords: hypercube
zbMATH Keywords: linear-time algorithm
zbMATH Keywords: long path
MaRDI profile type: Publication
full work available at URL: j.ins.2009.06.029
OpenAlex ID: W2076524741
cites work: Q4326630
cites work: Partitions of Faulty Hypercubes into Paths with Prescribed Endvertices
cites work: Long paths and cycles in hypercubes with faulty vertices
cites work: Longest fault-free paths in hypercubes with vertex faults
cites work: On Hamiltonian circuits and spanning trees of hypercubes
cites work: Graphs, networks and algorithms
cites work: Q4681162
cites work: Long paths in hypercubes with conditional node-faults
cites work: Q4002466
cites work: Hyper-Hamilton laceable and caterpillar-spannable product graphs
cites work: Data compression and Gray-code sorting
cites work: Edge Multiplicity and Other Trace Functions
DOI: 10.1016/J.INS.2009.06.029
description: scientific article; zbMATH DE number 5610286