Node-weighted triangle detection can be solved in optimal O(MM(n)) time with a simpler algorithm than previous work.
Time-space trade-offs for predecessor search
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2representative citing papers
Dynamic LCS maintained under edits in amortized O(log^7 n) time whp, with Omega(log n / log log n) lower bound.
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.
-
Dynamic Longest Common Substring in Polylogarithmic Time
Dynamic LCS maintained under edits in amortized O(log^7 n) time whp, with Omega(log n / log log n) lower bound.