2012•Lecture notes in computer scienceRequires access

Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width

Martin Doucha, Jan Kratochvı́l

Open publisher page 40 citations

Abstract

This record does not include an abstract. Use the full-text link above if available.

About this research paper

What this paper is about

An abstract is not available in the OpenAlex record for this paper.

Why it matters

OpenAlex reports 40 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Key concepts: Combinatorics, Parameterized complexity, Vertex cover, Neighbourhood (mathematics), Disjoint sets, Vertex (graph theory), Feedback vertex set, Clique graph

Back to paper search Browse research topics Original source

Cluster Vertex Deletion: A Parameterization between Vertex Cover and Clique-Width — Research Paper | ScholarLens