
The author presents a new algorithm for computing expander decompositions in directed graphs with near-optimal time complexity, simplifying previous approaches while maintaining efficiency.


coremsg

a-simple-and-near-optimal-algorithm-for-directed-expander-decompositions


A Simple and Near-Optimal Algorithm for Directed Expander Decompositions


title_rewrite


Maintaining expander decompositions in directed graphs efficiently.


directed-expander-decompositions-algorithm


Directed Expander Decompositions Algorithm



첫 번째 알고리즘을 소개합니다.
