Pages that link to "Item:Q1603430"
From MaRDI portal
The following pages link to A linear algorithm for the Hamiltonian completion number of the line graph of a tree (Q1603430):
Displayed 7 items.
- Cutting stock with no three parts per pattern: work-in-process and pattern minimization (Q429692) (← links)
- Hydras: directed hypergraphs and Horn formulas (Q507537) (← links)
- A lower bound on the Hamiltonian path completion number of a line graph (Q902504) (← links)
- A linear algorithm for the Hamiltonian completion number of the line graph of a cactus. (Q1427178) (← links)
- Evolutionary operators for the Hamiltonian completion problem (Q2156924) (← links)
- Local search algorithms for finding the Hamiltonian completion number of line graphs (Q2468757) (← links)
- Hamiltonian completions of sparse random graphs (Q2576345) (← links)