Pages that link to "Item:Q4044618"
From MaRDI portal
The following pages link to A Search Procedure for Hamilton Paths and Circuits (Q4044618):
Displayed 9 items.
- A matrix-based approach to searching colored paths in a weighted colored multidigraph (Q732496) (← links)
- Using matrices to link conflict evolution and resolution in a graph model (Q992610) (← links)
- An extension of the multi-path algorithm for finding Hamilton cycles (Q1197026) (← links)
- On a class of polynomials obtained from the circuits in a graph and its application to characteristic polynomials of graphs (Q1255017) (← links)
- HybridHAM: a novel hybrid heuristic for finding Hamiltonian cycle (Q1722882) (← links)
- A branch and bound algorithm for scheduling jobs with controllable processing times on a single machine to meet due dates (Q2430605) (← links)
- Counting Hamiltonian cycles in bipartite graphs (Q2871195) (← links)
- Understanding chicken walks on <i>n</i> × <i>n</i> grid: Hamiltonian paths, discrete dynamics, and rectifiable paths (Q3467125) (← links)
- Hamiltonian walks on the Sierpinski gasket (Q5256229) (← links)