Does finding a cycle with $\log n$ length in $\text{P}$?
-
05-11-2019 - |
Question
Let $G$ be an arbitrary graph with $n$ vertices and we want to find a simple cycle with $\log n$ length. Is there exists a known polynomial algorithm for this problem?
No correct solution
Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange