« first day (3871 days earlier)      last day (29 days later) » 

Martin Sleziak
Martin Sleziak
9:36 AM
1
Q: Which are good algorithms for finding Hamiltonian path (not necessarily a circle) up to now?

Licheng WangI am not expertise in graph theory. So have to ask this question here. The term "good" means that the algorithms should be efficient for general undirected simple connected graphs with a higher success probability. I also read the question Efficient Hamiltonian cycle algorithms for graph classe...

hamiltonian-graphs
 
b_jonas
b_jonas
@MartinSleziak oh. that needs something like graph-theory co.combinatorics, it can keep hamiltonian-graphs, and I wonder if we have a tag for combinatorial algorithms but I can't find one
"your edit summary must be at least 10 characters" wait, when did they add this?
 
Martin Sleziak
Martin Sleziak
@b_jonas I see this message mentioned in a post from 2011: Are we discouraged from fixing typos and misspellings on Stack Exchange sites?
There is a general tag called algorithms.
AFAICT, neither on MO nor on MSE there is separate tag for combinatorial algorithms.
The same for graph algorithms.
 

« first day (3871 days earlier)      last day (29 days later) »