The Internet Archive has a preservation copy of this work in our general collections.
The file type is `application/pdf`

.

##
###
Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts
[article]

2013
*
arXiv
*
pre-print

A skew-symmetric graph (D=(V,A),σ) is a directed graph D with an involution σ on the set of vertices and arcs. In this paper, we introduce a separation problem, d-Skew-Symmetric Multicut, where we are given a skew-symmetric graph D, a family of T of d-sized subsets of vertices and an integer k. The objective is to decide if there is a set X⊆ A of k arcs such that every set J in the family has a vertex v such that v and σ(v) are in different connected components of D'=(V,A∖ (X∪σ(X)). In this

arXiv:1304.7505v1
fatcat:bzafkg6glzahxl2jy7pzsfxttu