论文标题
混合连接的复杂性
The Complexity of Mixed-Connectivity
论文作者
论文摘要
我们研究了$ a $ a $ a和$ b $的参数化复杂性，以确定图〜$ g $的子集为$ a $ a $ vertices和$ b $边缘，其删除断开$ g $，还是断开两个处方的顶点$ s，t（g）$。
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)$.
