Reduction from Triangle Collection* to dynamic 4/3-Diameter: Revision history

28 April 2023

• curprev 09:4709:47, 28 April 2023‎ Admin talk contribs‎ 666 bytes +90‎ No edit summary Tag: Manual revert
• curprev 09:4709:47, 28 April 2023‎ Admin talk contribs‎ 576 bytes −134‎ No edit summary Tags: Manual revert Reverted
• curprev 09:4709:47, 28 April 2023‎ Admin talk contribs‎ 710 bytes +44‎ No edit summary Tags: Manual revert Reverted

10 April 2023

• curprev 08:5908:59, 10 April 2023‎ Admin talk contribs‎ 666 bytes +90‎ No edit summary Tag: Manual revert
• curprev 08:5908:59, 10 April 2023‎ Admin talk contribs‎ 576 bytes −134‎ No edit summary Tags: Manual revert Reverted
• curprev 08:5908:59, 10 April 2023‎ Admin talk contribs‎ 710 bytes +44‎ No edit summary Tags: Manual revert Reverted

15 February 2023

• curprev 11:1911:19, 15 February 2023‎ Admin talk contribs‎ 666 bytes +90‎ No edit summary Tag: Reverted
• curprev 11:1911:19, 15 February 2023‎ Admin talk contribs‎ 576 bytes −134‎ No edit summary

• curprev 11:1911:19, 15 February 2023‎ Admin talk contribs‎ 710 bytes +710‎ Created page with "FROM: Triangle Collection* TO: dynamic 4/3-Diameter == Description == == Implications == assume: SETH or {3}SUM Hypothesis or APSP Hypothesis<br/>then: there exists no incremental (or decremental) algorithm that approximates the diameter of unweighted graph within a factor of ${4}/{3}-\epsilon$ running in amortized time $O(n^{1/{2}-\epsilon'})$ for any $\epsilon,\epsilon' > {0}$. Furthermore, if we allow node insertions in the incremental case the bound is..."