Node-weighted triangle detection can be solved in optimal O(MM(n)) time with a simpler algorithm than previous work.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
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.