Reduction from Triangle Detection to Dynamic Bipartite Maximum-Weight Matching

From Algorithm Wiki
Jump to navigation Jump to search

FROM: Triangle Detection TO: Dynamic Bipartite Maximum-Weight Matching

Description

Implications

let $\gamma = (w-{1})/(w+{1}) \in ({1}/{3},{0.408})$
if: to-time: $O(m^{2\gamma-\epsilon})$ update and query times even after O(m^{1+\gamma-\epsilon}) preprocessing time for any $\epsilon > {0}$
then: Strong Triangle is false

Year

2014

Reference

Abboud, Amir, and Virginia Vassilevska Williams. "Popular conjectures imply strong lower bounds for dynamic problems." In 2014 IEEE 55th Annual Symposium on Foundations of Computer Science, pp. 434-443. IEEE, 2014.

https://ieeexplore.ieee.org/abstract/document/6979028?casa_token=daaoBjrHUa4AAAAA:DCjk_WMWZ5Is6KvGpmS8a2bL9LskvV0P1zEG4U2u-Tm_C8sixu1w65OpTyjml1HEpaikXhtYsg