Even faster parameterized cluster deletion and cluster editing (Q1944120): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cluster Editing Problem: Implementations and Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph-modeled data clustering: Exact algorithms for clique generation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter algorithms for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter enumerability of cluster editing and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Going weighted: parameterized algorithms for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A more effective linear kernelization for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: A 2k Kernel for the Cluster Editing Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Automated generation of search tree algorithms for hard graphs modification problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing problem for points on the real line: a polynomial time algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: Beyond the flow decomposition barrier / rank
 
Normal rank

Latest revision as of 07:39, 6 July 2024

scientific article
Language Label Description Also known as
English
Even faster parameterized cluster deletion and cluster editing
scientific article

    Statements

    Even faster parameterized cluster deletion and cluster editing (English)
    0 references
    0 references
    0 references
    4 April 2013
    0 references
    graph algorithms
    0 references
    cluster deletion
    0 references
    cluster editing
    0 references
    parameterized complexity
    0 references
    graph transformation
    0 references
    edge deletion
    0 references
    eddge editing
    0 references

    Identifiers