A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is `application/pdf`

.

##
###
On r-Simple k-Path and Related Problems Parameterized by k/r
[article]

2020
*
arXiv
*
pre-print

Abasi et al. (2014) and Gabizon et al. (2015) studied the following problems. In the r-Simple k-Path problem, given a digraph G on n vertices and integers r,k, decide whether G has an r-simple k-path, which is a walk where every vertex occurs at most r times and the total number of vertex occurrences is k. In the (r,k)-Monomial Detection problem, given an arithmetic circuit that encodes some polynomial P on n variables and integers k,r, decide whether P has a monomial of degree k where the

arXiv:1806.09108v2
fatcat:hcu4slsv7rbcra5yt53qunx32a