25 citations · 44 across the 8 of their papers we have counts for
3 papers · 1 filter
Mining Maximal Induced Bicliques using Odd Cycle Transversals
Kyle Kloster, Blair D. Sullivan, Andrew van der Poel
Many common graph data mining tasks take the form of identifying dense subgraphs (e.g. clustering, clique-finding, etc). In biological applications, the natural model for these den…
Structural Rounding: Approximation Algorithms for Graphs Near an Algorithmically Tractable Class
Erik D. Demaine, Timothy D. Goodrich, Kyle Kloster +5
We develop a new framework for generalizing approximation algorithms from the structural graph algorithm literature so that they apply to graphs somewhat close to that class (a sce…
Subgraph centrality and walk-regularity
Eric Horton, Kyle Kloster, Blair D. Sullivan
Matrix-based centrality measures have enjoyed significant popularity in network analysis, in no small part due to our ability to rigorously analyze their behavior as parameters var…