First O(n^{2-1/(2h-2)} polylog n) algorithm for diameter and eccentricity in real-weighted K_h-minor-free digraphs via randomized search-to-decision reduction on VC-dimension.
Expander Decomposition and Pruning: Faster, Stronger, and Simpler , booktitle =
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
fields
cs.DS 2verdicts
UNVERDICTED 2representative citing papers
First practical algorithm for expander hierarchies used to build a normalized-cut solver that beats state-of-the-art quality on large real-world graphs.
citing papers explorer
-
Real-weighted Diameter and Eccentricity of Minor-free and Bounded VC-dimension Graphs in Truly Subquadratic Time
First O(n^{2-1/(2h-2)} polylog n) algorithm for diameter and eccentricity in real-weighted K_h-minor-free digraphs via randomized search-to-decision reduction on VC-dimension.
-
Expander Hierarchies for Normalized Cuts on Graphs
First practical algorithm for expander hierarchies used to build a normalized-cut solver that beats state-of-the-art quality on large real-world graphs.