5 citations · 5 across the 3 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.DM2017
Local Structure Theorems for Erdos Renyi Graphs and their Algorithmic Application
Jan Dreier, Philipp Kuinke, Ba Le Xuan +1
We analyze some local properties of sparse Erdos-Renyi graphs, where is the edge probability. In particular we study the behavior of very short paths. For …
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…