kkloste
Data, algorithms, graphs, and matrices. SWE at Carbon3d doing Computational Geometry. Former Math/CS PhD research at Purdue Univ and NCSU.
Data science, scientific computingSan Francisco Bay
Pinned Repositories
connectivity-search-manuscript
Manuscript describing Hetnet Connectivity Search
Diffunity
Variety of local graph diffusion codes for targeted network analysis and community detection
hkgrow
Heat-kernel based local clustering
lemon-sqz
Toward scalable, robust community detection and other semi-supervised learning tasks
MI-bicliques
Algorithms for enumerating maximal induced bicliques. OCT-MIB is designed for graphs which are "near bipartite" described in Kloster et al. 2018+; LexMIB is an improved version of the algorithm described in Dias et al. 2005.
nexpokit
Matrix Exponential for node centrality, link-prediction, and more
pagerank-paths
Local graph analysis via PageRank solution paths
smasharchive64
HTML interface for querying competitive Smash 64 tournament archive
MI-bicliques
Algorithms for enumerating maximal induced bicliques. OCT-MIB is designed for graphs which are "near bipartite" described in Kloster et al. 2018+; LexMIB is an improved version of the algorithm described in Dias et al. 2005.
toboggan
A practical fpt algorithm for Flow Decomposition and transcript assembly
kkloste's Repositories
kkloste/nexpokit
Matrix Exponential for node centrality, link-prediction, and more
kkloste/hkgrow
Heat-kernel based local clustering
kkloste/lemon-sqz
Toward scalable, robust community detection and other semi-supervised learning tasks
kkloste/pagerank-paths
Local graph analysis via PageRank solution paths
kkloste/Diffunity
Variety of local graph diffusion codes for targeted network analysis and community detection
kkloste/smasharchive64
HTML interface for querying competitive Smash 64 tournament archive
kkloste/connectivity-search-manuscript
Manuscript describing Hetnet Connectivity Search
kkloste/MI-bicliques
Algorithms for enumerating maximal induced bicliques. OCT-MIB is designed for graphs which are "near bipartite" described in Kloster et al. 2018+; LexMIB is an improved version of the algorithm described in Dias et al. 2005.
kkloste/toboggan
A practical fpt algorithm for Flow Decomposition and transcript assembly
kkloste/xswap-manuscript
Manuscript on XSwap network permutation and hetnet node degrees