A fixed-parameter branching algorithm for chromatic correlation clustering

DOI10.1007/978-3-031-92935-9_7MaRDI QIDQ6902120zbMATH OpenFDO

Authors Kensuke Oowa, Peter Fulla, Takuro Fukunaga

Publication date 11 November 2025

Full work available at URL https://doi.org/10.1007/978-3-031-92935-9_7

zbMATH Keywords

branching algorithmschromatic correlation clusteringcluster editingcomputational complexityFPTgraph algorithmsparameterized algorithmssearch tree algorithms

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx)

Cites work

• A golden ratio parameterized algorithm for cluster editing
• Alternative parameterizations for cluster editing
• Automated generation of search tree algorithms for hard graphs modification problems
• Cluster editing
• Cluster editing with locally bounded modifications
• Combining clickstream analyses and graph-modeled data clustering for identifying common response processes
• Correlation clustering
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• On the complexity of multi-parameterized cluster editing
• Parameterized algorithms

This page was built for publication: A fixed-parameter branching algorithm for chromatic correlation clustering

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6902120)