The Expander Hierarchy and its Applications to Dynamic Graph Algorithms

Goranci Gramoz
Goranci Gramoz
Tan Zihan
Tan Zihan

symposium on discrete algorithms, 2020.

Cited by: 0|Bibtex|Views13
Other Links: arxiv.org|academic.microsoft.com

Abstract:

We introduce a notion for hierarchical graph clustering which we call the expander hierarchy and show a fully dynamic algorithm for maintaining such a hierarchy on a graph with $n$ vertices undergoing edge insertions and deletions using $n^{o(1)}$ update time. An expander hierarchy is a tree representation of graphs that faithfully capt...More

Code:

Data:

Full Text
Your rating :
0

 

Tags
Comments