Revisiting Connected Vertex Cover: FPT Algorithms and Lossy Kernels
Sign Up to like & getrecommendations! Published in 2017 at "Theory of Computing Systems"
DOI: 10.1007/s00224-017-9837-y
Abstract: AbstractThe Connected Vertex Cover problem asks for a vertex cover in a graph that induces a connected subgraph. The problem is known to be fixed-parameter tractable (FPT), and is unlikely to have a polynomial sized… read more here.
Keywords: lceil frac; frac alpha; vertex cover; connected vertex ... See more keywords
Quenched decay of correlations for slowly mixing systems
Sign Up to like & getrecommendations! Published in 2019 at "Transactions of the American Mathematical Society"
DOI: 10.1090/tran/7811
Abstract: We study random towers that are suitable to analyse the statistics of slowly mixing random systems. We obtain upper bounds on the rate of quenched correlation decay in a general setting. We apply our results… read more here.
Keywords: alpha; frac alpha; slowly mixing; quenched decay ... See more keywords
Bifurcations of a two-dimensional discrete-time predator–prey model
Sign Up to like & getrecommendations! Published in 2019 at "Advances in Difference Equations"
DOI: 10.1186/s13662-019-1995-6
Abstract: We study the local dynamics and bifurcations of a two-dimensional discrete-time predator–prey model in the closed first quadrant R+2$\mathbb{R}_{+}^{2}$. It is proved that the model has two boundary equilibria: O(0,0)$O(0,0)$, A(α1−1α1,0)$A (\frac{\alpha _{1}-1}{\alpha _{1}},0 )$… read more here.
Keywords: alpha; discrete time; frac alpha; model ... See more keywords