143 citations · 381 across the 13 of their papers we have counts for
Showing 2015Show all
2 papers · 1 filter
cs.DS2015★ 1 cited
Greedy Matching: Guarantees and Limitations
Bert Besser, Matthias Poloczek
Since Tinhofer proposed the MinGreedy algorithm for maximum cardinality matching in 1984, several experimental studies found the randomized algorithm to perform excellently for var…
cs.DM2015
Contagious Sets in Dense Graphs
Daniel Freund, Matthias Poloczek, Daniel Reichman
We study the activation process in undirected graphs known as bootstrap percolation: a vertex is active either if it belongs to a set of initially activated vertices or if at some…