Feedback Vertex Set Inspired Kernel for Chordal Vertex Deletion
Work
Year: 2018
Type: article
Abstract: Given a graph G and a parameter k , the C hordal V ertex D eletion (CVD) problem asks whether there exists a subset U ⊆ V ( G ) of size at most k that hits all induced cycles of size at least 4. The e... more
Source: ACM Transactions on Algorithms
Institutions Hungarian Academy of Sciences, University of Bergen, Institute of Mathematical Sciences, Ben-Gurion University of the Negev
Cites: 42
Cited by: 22
Related to: 10
FWCI: 2.075
Citation percentile (by year/subfield): 99.99
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: green