Eliminating graphs by means of parallel knock-out schemes (Q867852): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1016/j.dam.2006.04.034 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2071675546 / rank | |||
Normal rank | |||
Revision as of 20:06, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Eliminating graphs by means of parallel knock-out schemes |
scientific article |
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
