{"paper":{"title":"Subset Feedback Vertex Set in Chordal and Split Graphs","license":"http://arxiv.org/licenses/nonexclusive-distrib/1.0/","headline":"","cross_cats":[],"primary_cat":"cs.DS","authors_text":"Geevarghese Philip, Prafullkumar Tale, Saket Saurabh, Varun Rajan","submitted_at":"2019-01-08T08:50:02Z","abstract_excerpt":"In the \\textsc{Subset Feedback Vertex Set (Subset-FVS)} problem the input is a graph $G$, a subset \\(T\\) of vertices of \\(G\\)  called the `terminal' vertices, and an integer $k$. The task is to determine whether there exists a subset of vertices of cardinality at most $k$ which together intersect all cycles which pass through the terminals. \\textsc{Subset-FVS} generalizes several well studied problems including \\textsc{Feedback Vertex Set} and \\textsc{Multiway Cut}. This problem is known to be \\NP-Complete even in split graphs. Cygan et al. proved that \\textsc{Subset-FVS} is fixed parameter tr"},"claims":{"count":0,"items":[],"snapshot_sha256":"258153158e38e3291e3d48162225fcdb2d5a3ed65a07baac614ab91432fd4f57"},"source":{"id":"1901.02209","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"}