Reduction from Min-Weight k-Cycle to Undirected Wiener Index

FROM: Min-Weight k-Cycle TO: Undirected Wiener Index

Implications

if: to-time: $f(N,M)$ for N nodes, M edges
then: from-time: $\tilde{O}(f(N,M)+M)$

Year

2018

Reference

Andrea Lincoln, Virginia Vassilevska Williams, and R. Ryan Williams. Tight hardness for shortest cycles and paths in sparse graphs. In Proc. SODA, page to appear, 2018.

https://arxiv.org/pdf/1712.08147v2.pdf, Theorem B.2