New answers tagged cycles
0
votes
Efficient Hamiltonian cycle algorithms for graph classes
Even though the Hamilton path problem is NP-hard, in practice it is usually easy. An efficient algorithm has been known for 50 years. It is "A Search Procedure for Hamilton Paths and Circuits.&...
Top 50 recent answers are included
Related Tags
cycles × 50graph-theory × 32
co.combinatorics × 16
algorithms × 9
ag.algebraic-geometry × 5
permutations × 5
gr.group-theory × 4
extremal-graph-theory × 4
bipartite-graphs × 3
hamiltonian-graphs × 3
pr.probability × 2
ds.dynamical-systems × 2
arithmetic-geometry × 2
random-graphs × 2
extremal-combinatorics × 2
packing-and-covering × 2
matching-theory × 2
perfect-matchings × 2
nt.number-theory × 1
reference-request × 1
ct.category-theory × 1
matrices × 1
cv.complex-variables × 1
finite-groups × 1
prime-numbers × 1