Eliminating graphs by means of parallel knock-out schemes (Q867852)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 5128015
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Eliminating graphs by means of parallel knock-out schemes |
scientific article; zbMATH DE number 5128015 |
Statements
Eliminating graphs by means of parallel knock-out schemes (English)
0 references
19 February 2007
0 references
knock-out number
0 references
Hamiltonian cycle
0 references
perfect matching
0 references
tree
0 references
claw-free graph
0 references
computational complexity
0 references
dynamic programming
0 references
0.9633737206459044
0 references
0.8932084441184998
0 references
0.8926801681518555
0 references
0.8745747804641724
0 references
0.8612751960754395
0 references
