14 citations · 52 across the 41 of their papers we have counts for
Showing cs.DSShow all
2 papers · 1 filter
cs.DS2023
Edge-disjoint paths in expanders: online with removals
Nemanja Draganić, Rajko Nenadov
We consider the problem of finding edge-disjoint paths between given pairs of vertices in a sufficiently strong -regular expander graph with vertices. In particular, we…
cs.DS2020★ 2 cited
An O(n) time algorithm for finding Hamilton cycles with high probability
Rajko Nenadov, Angelika Steger, Pascal Su
We design a randomized algorithm that finds a Hamilton cycle in time with high probability in a random graph with edge probability . T…