1 citations · 1 across the 2 of their papers we have counts for
2 papers
cs.DS2025
Efficient Contractions of Dynamic Graphs -- with Applications
Monika Henzinger, Evangelos Kosinas, Robin Münk +1
A non-trivial minimum cut (NMC) sparsifier is a multigraph that preserves all non-trivial minimum cuts of a given undirected graph . We introduce a flexible data struc…
cs.DS2024★ 1 cited
Expander Hierarchies for Normalized Cuts on Graphs
Kathrin Hanauer, Monika Henzinger, Robin Münk +2
Expander decompositions of graphs have significantly advanced the understanding of many classical graph problems and led to numerous fundamental theoretical results. However, their…