Let $ G$ be an arbitrary graph with $ n$ vertices and we want to find a cycle with $ \log n$ length. Is there exists a known polynomial algorithm for this problem?

Skip to content
# Tag: cycle

## Does finding a cycle with $\log n$ length in $\text{P}$ ?

100% Private Proxies – Fast, Anonymous, Quality, Unlimited USA Private Proxy!

Get your private proxies now!

Let $ G$ be an arbitrary graph with $ n$ vertices and we want to find a cycle with $ \log n$ length. Is there exists a known polynomial algorithm for this problem?