{"paper":{"title":"Linear Time Parameterized Algorithms via Skew-Symmetric Multicuts","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":["cs.DM"],"primary_cat":"cs.DS","authors_text":"M. S. Ramanujan, Saket Saurabh","submitted_at":"2013-04-28T19:23:40Z","abstract_excerpt":"A skew-symmetric graph $(D=(V,A),\\sigma)$ is a directed graph $D$ with an involution $\\sigma$ 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 $\\cal T$ of $d$-sized subsets of vertices and an integer $k$. The objective is to decide if there is a set $X\\subseteq A$ of $k$ arcs such that every set $J$ in the family has a vertex $v$ such that $v$ and $\\sigma(v)$ are in different connected components of $D'=(V,A\\setminus (X\\cup \\sigma(X))$. In this paper, we give an algorithm f"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1304.7505","kind":"arxiv","version":1},"verdict":{"id":null,"model_set":{},"created_at":null,"strongest_claim":"","one_line_summary":"","pipeline_version":null,"weakest_assumption":"","pith_extraction_headline":""},"references":{"count":0,"sample":[],"resolved_work":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57","internal_anchors":0},"formal_canon":{"evidence_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"author_claims":{"count":0,"strong_count":0,"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"builder_version":"pith-number-builder-2026-05-17-v1"}