25 citations · 44 across the 8 of their papers we have counts for
11 papers
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…
Walk entropy and walk-regularity
Kyle Kloster, Daniel Král', Blair D. Sullivan
A graph is said to be walk-regular if, for each , every vertex is contained in the same number of closed walks of length . We construct a -vertex graph …
A practical fpt algorithm for Flow Decomposition and transcript assembly
Kyle Kloster, Philipp Kuinke, Michael P. O'Brien +4
The Flow Decomposition problem, which asks for the smallest set of weighted paths that "covers" a flow on a DAG, has recently been used as an important computational step in transc…
Scalable and Robust Local Community Detection via Adaptive Subgraph Extraction and Diffusions
Kyle Kloster, Yixuan Li
Local community detection, the problem of identifying a set of relevant nodes nearby a small set of input seed nodes, is an important graph primitive with a wealth of applications…