A more effective linear kernelization for cluster editing (Q1006044): Difference between revisions

From MaRDI portal
m rollbackEdits.php mass rollback
Tag: Rollback
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.1016/j.tcs.2008.10.021 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2174049388 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregating inconsistent information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial-time data reduction for dominating set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering / 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: Going Weighted: Parameterized Algorithms for Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact Algorithms for Cluster Editing: Evaluation and Experiments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering with qualitative information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing Phylogenetic Roots with Bounded Degrees and Errors / 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-Theoretic Concepts in Computer Science / rank
 
Normal rank
Property / cites work
 
Property / cites work: Error compensation in leaf power problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Lost Continent of Polynomial Time: Preprocessing and Kernelization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Correlation clustering with a fixed number of clusters / 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: A More Effective Linear Kernelization for Cluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: NP-hard problems in hierarchical-tree clustering / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4472526 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Applying Modular Decomposition to Parameterized Bicluster Editing / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cluster graph modification problems / rank
 
Normal rank

Latest revision as of 04:26, 29 June 2024

scientific article
Language Label Description Also known as
English
A more effective linear kernelization for cluster editing
scientific article

    Statements

    A more effective linear kernelization for cluster editing (English)
    0 references
    0 references
    17 March 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    fixed-parameter tractability
    0 references
    computational biology
    0 references
    preprocessing
    0 references
    data reduction
    0 references
    0 references