The following pages link to Algorithms and Data Structures (Q5900763):
Displayed 8 items.
- Deterministic ``snakes and ladders'' heuristic for the Hamiltonian cycle problem (Q744218) (← links)
- Improved edge-coloring with three colors (Q837164) (← links)
- Solving connected dominating set faster than \(2^n\) (Q958203) (← links)
- Approximating the maximum clique minor and some subgraph homeomorphism problems (Q1022596) (← links)
- A note on using the resistance-distance matrix to solve Hamiltonian cycle problem (Q1708538) (← links)
- Finding a Hamiltonian cycle by finding the global minimizer of a linearly constrained problem (Q2070343) (← links)
- Open problems around exact algorithms (Q2473037) (← links)
- Change ringing and Hamiltonian cycles: The search for Erin and Stedman triples (Q5009933) (← links)