published by Sergio Cabello
in 2020
in Informatics Engineering
and research's language is
English
Download
Abstract in English
We investigate the parameterized complexity in $a$ and $b$ of determining whether a graph~$G$ has a subset of $a$ vertices and $b$ edges whose removal disconnects $G$, or disconnects two prescribed vertices $s, t in V(G)$.
