27 citations · 100 across the 31 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Approximating Vertex Cover using Structural Rounding
Brian Lavallee, Hayley Russell, Blair D. Sullivan +1
In this work, we provide the first practical evaluation of the structural rounding framework for approximation algorithms. Structural rounding works by first editing to a well-stru…
cs.DS2019
Faster Biclique Mining in Near-Bipartite Graphs
Blair D. Sullivan, Andrew van der Poel, Trey Woodlief
Identifying dense bipartite subgraphs is a common graph data mining task. Many applications focus on the enumeration of all maximal bicliques (MBs), though sometimes the stricter v…