Computational complexity of long paths and cycles in faulty hypercubes (Q708231)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Computational complexity of long paths and cycles in faulty hypercubes |
scientific article; zbMATH DE number 5798147
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Computational complexity of long paths and cycles in faulty hypercubes |
scientific article; zbMATH DE number 5798147 |
Statements
Computational complexity of long paths and cycles in faulty hypercubes (English)
0 references
11 October 2010
0 references
faulty vertex
0 references
hypercube
0 references
long path
0 references
long cycle
0 references
NP-hard
0 references
0.9090623259544371
0 references
0.8642908930778503
0 references
0.862123966217041
0 references
0.8555099964141846
0 references
0.8509584665298462
0 references
