All Questions
2 questions
2
votes
2
answers
461
views
On Knot Equivalence problem statement
How is the knot equivalence problem represented?
By this I mean I am looking for an analogy that compares with graph equivalence. For graph equivalence, we have two graphs $G_1$ and $G_2$ with ...
- 13.9k
2
votes
1
answer
403
views
Finding a 5-cycle in a sparse graph efficiently.
Hi,
I was reading this thread: Finding a cycle of fixed length
I want to find a 5-cycle in a graph. Actually, what I really want is a shortest odd cycle of length at least 5, but maybe that is a ...
- 1,834