On the parameterized complexity of labelled correlation clustering problem

DOI10.1007/978-3-319-08783-2_24MaRDI QIDQ2920466zbMATH OpenOpenAlexFDO

Authors Xianmin Liu, Hong Gao, Jianzhong Li

Publication date 26 September 2014

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-08783-2_24

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• On the hardness of labeled correlation clustering problem: a parameterized complexity view
• Algorithms and complexity results for labeled correlation clustering problem
• A note on the inapproximability of correlation clustering
• The parameterized complexity of some minimum label problems
• The parameterized complexity of some minimum label problems

Cited in

(3)

• Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
• On the hardness of labeled correlation clustering problem: a parameterized complexity view
• Algorithms and complexity results for labeled correlation clustering problem

This page was built for publication: On the parameterized complexity of labelled correlation clustering problem

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