{"paper":{"title":"Simultaneous Feedback Vertex Set: A Parameterized Perspective","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Akanksha Agrawal, Amer E. Mouawad, Daniel Lokshtanov, Saket Saurabh","submitted_at":"2015-10-06T12:49:14Z","abstract_excerpt":"Given a family of graphs $\\mathcal{F}$, a graph $G$, and a positive integer $k$, the $\\mathcal{F}$-Deletion problem asks whether we can delete at most $k$ vertices from $G$ to obtain a graph in $\\mathcal{F}$. $\\mathcal{F}$-Deletion generalizes many classical graph problems such as Vertex Cover, Feedback Vertex Set, and Odd Cycle Transversal. A graph $G = (V, \\cup_{i=1}^{\\alpha} E_{i})$, where the edge set of $G$ is partitioned into $\\alpha$ color classes, is called an $\\alpha$-edge-colored graph. A natural extension of the $\\mathcal{F}$-Deletion problem to edge-colored graphs is the $\\alpha$-S"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1510.01557","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"}