Parameterized complexity of critical node cuts
We consider the following graph cut problem called Critical Node Cut (CNC): Given a graph G on n vertices, and two positive integers k and x, determine whether G has a set of k vertices whose removal leaves G with at most x connected pairs of vertices. We analyze this problem in the framework of par...
|Published in:||Theoretical computer science : the journal of the EATCS, Vol. 651 (2016), p. 62-75|
|Other Involved Persons:||; ;|
|QR Code:||Show QR Code|