3 citations · 3 across the 7 of their papers we have counts for
Showing 2025Show all
2 papers · 1 filter
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.DS2025
An Optimal -Fault-Tolerant Connectivity Oracle
Evangelos Kosinas
We present an optimal oracle for answering connectivity queries in undirected graphs in the presence of at most three vertex failures. Specifically, we show that we can process a g…