Achieves (2k/3)-approximation for girth in weighted graphs in Õ(m + n^{1+2/k}) time for every k≥2, improving prior partial results, plus new fine-grained lower bounds for unweighted girth approximation.
Title resolution pending
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2verdicts
UNVERDICTED 2representative citing papers
HyperCSA compresses real-world hypergraphs to 26-79% of original size using suffix sorting, scales to larger data than prior methods, and runs neighbor queries 6-40 times faster.
citing papers explorer
-
Tighter bounds for weighted and unweighted shortest cycle approximation
Achieves (2k/3)-approximation for girth in weighted graphs in Õ(m + n^{1+2/k}) time for every k≥2, improving prior partial results, plus new fine-grained lower bounds for unweighted girth approximation.
-
Compressing Hypergraphs using Suffix Sorting
HyperCSA compresses real-world hypergraphs to 26-79% of original size using suffix sorting, scales to larger data than prior methods, and runs neighbor queries 6-40 times faster.