25 citations · 44 across the 8 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
math.CO2017
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 …
cs.DS2017
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…