Clustering with partial information

DOI10.1016/J.TCS.2009.12.016MaRDI QIDQ2268879zbMATH OpenOpenAlexWikidataFDO

Authors Michael R. Fellows, Pinar Heggernes, F. Mancini, Charis Papadopoulos, Hans L. Bodlaender, Frances Rosamond

Publication date 9 March 2010

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2009.12.016

zbMATH Keywords

cluster editinggraphskernelsparameterized algorithms

Mathematics Subject Classification ID

Fractional graph theory, fuzzy graph theory (05C72) Graph operations (line graphs, products, etc.) (05C76) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Clustering with Partial Information
• scientific article; zbMATH DE number 1953109
• Graph-modeled data clustering: Exact algorithms for clique generation
• Cluster graph modification problems
• scientific article; zbMATH DE number 2011849

Cites work

• A More Effective Linear Kernelization for Cluster Editing
• Aggregating inconsistent information: ranking and clustering
• Algorithms - ESA 2003
• Applying Modular Decomposition to Parameterized Bicluster Editing
• Cluster graph modification problems
• Clustering with Partial Information
• Clustering with qualitative information
• Computing Phylogenetic Roots with Bounded Degrees and Errors
• Correlation clustering
• Correlation clustering in general weighted graphs
• Correlation clustering with partial information
• Efficient Parameterized Preprocessing for Cluster Editing
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Going weighted: parameterized algorithms for cluster editing
• Graph Sandwich Problems
• Graph-modeled data clustering: Exact algorithms for clique generation
• scientific article; zbMATH DE number 3582190 (Why is no real title available?)
• scientific article; zbMATH DE number 1161563 (Why is no real title available?)
• scientific article; zbMATH DE number 4121434 (Why is no real title available?)
• scientific article; zbMATH DE number 2234775 (Why is no real title available?)
• NP-hard problems in hierarchical-tree clustering
• Parameterized and Exact Computation
• Recent developments in maximum flow algorithms
• The Lost Continent of Polynomial Time: Preprocessing and Kernelization

Cited in

(9)

• Tight bounds for parameterized complexity of cluster editing with a small number of clusters
• On the parameterized complexity of clustering problems for incomplete data
• Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
• Clustering with Partial Information
• Information-based clustering
• Cluster editing parameterized above modification-disjoint P₃-packings
• The complexity of cluster vertex splitting and company
• Cluster editing parameterized above modification-disjoint P₃-Packings
• Parameterized algorithms for editing to uniform cluster graph

This page was built for publication: Clustering with partial information

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