A simple (2+ϵ)-approximation algorithm for Split Vertex Deletion
A split graph is a graph whose vertex set can be partitioned into a clique and a stable set. Given a graph G and weight function w:V(G)→Q≥0, the Split Vertex Deletion (SVD) problem asks to find a minimum weight set of vertices X such that G−X is a split graph. It is easy to show that a graph is a sp...
Saved in:
| Published in: | European journal of combinatorics Vol. 121; p. 103844 |
|---|---|
| Main Authors: | , , |
| Format: | Journal Article |
| Language: | English |
| Published: |
Elsevier Ltd
01.10.2024
|
| ISSN: | 0195-6698, 1095-9971 |
| Online Access: | Get full text |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Be the first to leave a comment!