Node-weighted triangle detection can be solved in optimal O(MM(n)) time with a simpler algorithm than previous work.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2026 2representative citing papers
Jaguar evaluates Boolean conjunctive queries in O(N^{subw(Q) + ε}) time for any ε > 0 by operating directly in the primal space of polymatroids and adaptively bounding join costs.
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.
-
Jaguar: A Primal Algorithm for Conjunctive Query Evaluation in Submodular-Width Time
Jaguar evaluates Boolean conjunctive queries in O(N^{subw(Q) + ε}) time for any ε > 0 by operating directly in the primal space of polymatroids and adaptively bounding join costs.