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.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DS 1years
2024 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
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.