3 citations · 9 across the 8 of their papers we have counts for
Showing cs.DMShow all
2 papers · 1 filter
cs.DM2015
Rank Aggregation: New Bounds for MCx
Daniel Freund, David P. Williamson
The rank aggregation problem has received significant recent attention within the computer science community. Its applications today range far beyond the original aim of building m…
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…