A fast branching algorithm for cluster vertex deletion (Q255285): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q59473167, #quickstatements; #temporary_batch_1710199756243
ReferenceBot (talk | contribs)
Changed an Item
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s00224-015-9631-7 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2001878420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A kernelization algorithm for \(d\)-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels: Annotated, Proper and Induced / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregating inconsistent information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: A golden ratio parameterized algorithm for cluster editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-parameter tractability of graph modification problems for hereditary properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering with qualitative information / 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: A top-down approach to search-trees: Improved algorithmics for 3-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact exponential algorithms. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds for parameterized complexity of cluster editing with a small number of clusters / 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: Fixed-parameter algorithms for cluster vertex deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for graph search and connectivity determination on complement graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding odd cycle transversals. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster editing with locally bounded modifications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying modular decomposition to parameterized cluster editing problems / rank
 
Normal rank

Revision as of 13:41, 11 July 2024

scientific article
Language Label Description Also known as
English
A fast branching algorithm for cluster vertex deletion
scientific article

    Statements

    A fast branching algorithm for cluster vertex deletion (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    9 March 2016
    0 references
    fixed-parameter algorithms
    0 references
    cluster vertex deletion
    0 references
    branching
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references