The author presents a new algorithm for computing expander decompositions in directed graphs with near-optimal time complexity, simplifying previous approaches while maintaining efficiency.
Maintaining expander decompositions in directed graphs efficiently.
첫 번째 알고리즘을 소개합니다.