Computational complexity of long paths and cycles in faulty hypercubes

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F10%3A10022138" target="_blank" >RIV/00216208:11320/10:10022138 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Computational complexity of long paths and cycles in faulty hypercubes
Original language description
The problem of existence of an optimal-length (long) fault-free cycle in the n-dimensional hypercube with f faulty vertices is NP-hard. This holds even in case that f is bounded by a polynomial of degree three (six) with respect to n. On the other hand,there is a linear (quadratic) bound on f which guarantees that the problem is decidable in polynomial time. Similar results are obtained for paths as well as for paths between prescribed endvertices.
Czech name
—
Czech description
—

Type
J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)
CEP classification
IN - Informatics
OECD FORD branch
—

Project
<a href="/en/project/1ET100300517" target="_blank" >1ET100300517: Methods for Intelligent Systems and Their Applications in Datamining and Natural Language Processing</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)<br>Z - Vyzkumny zamer (s odkazem do CEZ)

Publication year
2010
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Similar results(10)