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.
Compact Routing for Graphs Excluding a Fixed Minor , booktitle =
3 Pith papers cite this work. Polarity classification is still indexing.
3
Pith papers citing it
years
2026 3verdicts
UNVERDICTED 3representative citing papers
Improved (O(pw), Δ)-LDD for pathwidth-pw digraphs and O(tw log n) integrality gap for directed sparsest-cut LP on treewidth-tw graphs via refined quasipartition analysis.
OptChain is a sharding protocol for permissionless blockchains that approaches the theoretical upper bound on throughput by optimizing vertical and horizontal scalability while preserving security.
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.
-
Directed Low Diameter Decomposition for Structured Digraphs
Improved (O(pw), Δ)-LDD for pathwidth-pw digraphs and O(tw log n) integrality gap for directed sparsest-cut LP on treewidth-tw graphs via refined quasipartition analysis.
-
OptChain: Achieving Optimal Throughput of Permissionless Blockchains
OptChain is a sharding protocol for permissionless blockchains that approaches the theoretical upper bound on throughput by optimizing vertical and horizontal scalability while preserving security.