Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Local search algorithms for finding the Hamiltonian completion number of line graphs |
scientific article |
Statements
Local search algorithms for finding the Hamiltonian completion number of line graphs (English)
0 references
25 January 2008
0 references
Hamiltonian completion number
0 references
dominating trail set
0 references
local search
0 references
graph algorithms
0 references
line graphs
0 references
0 references
0 references
0 references
