Sciweavers

SIGECOM
2010
ACM
153views ECommerce» more  SIGECOM 2010»
13 years 10 months ago
Fast algorithms for finding matchings in lopsided bipartite graphs with applications to display ads
We derive efficient algorithms for both detecting and representing matchings in lopsided bipartite graphs; such graphs have so many nodes on one side that it is infeasible to repr...
Denis Charles, Max Chickering, Nikhil R. Devanur, ...