AI RESEARCH

Expander Hierarchies for Normalized Cuts on Graphs

arXiv CS.LG

ArXi:2406.14111v2 Announce Type: replace-cross Expander decompositions of graphs have significantly advanced the understanding of many classical graph problems and led to numerous fundamental theoretical results. However, their adoption in practice has been hindered due to their inherent intricacies and large hidden factors in their asymptotic running times. Here, we