Node-weighted triangle detection can be solved in optimal O(MM(n)) time with a simpler algorithm than previous work.
Ryan , year =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
fields
cs.DS 3years
2026 3verdicts
UNVERDICTED 3representative citing papers
A weight-preserving reduction from undirected 2-FRP to SSRP establishes their computational equivalence and yields matching improved algorithms for 2-FRP.
Deterministic Monotone Min-Plus Product in O(n^{2.686}) time matching the randomized bound and derandomizing applications including Language Edit Distance and RNA Folding.
citing papers explorer
-
Node-Weighted Triangles: Faster and Simpler
Node-weighted triangle detection can be solved in optimal O(MM(n)) time with a simpler algorithm than previous work.
-
Undirected Replacement Paths: Dual Fault Reduces to Single Source
A weight-preserving reduction from undirected 2-FRP to SSRP establishes their computational equivalence and yields matching improved algorithms for 2-FRP.
-
Deterministic Monotone Min-Plus Product and Convolution
Deterministic Monotone Min-Plus Product in O(n^{2.686}) time matching the randomized bound and derandomizing applications including Language Edit Distance and RNA Folding.