The Complexity of Mixed-Connectivity
share
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 ∈ V(G).
READ FULL TEXT