Clustering with Partial Information

DOI10.1007/978-3-540-85238-4_11zbMath1173.68596OpenAlexW2107080175WikidataQ57359861 ScholiaQ57359861MaRDI QIDQ3599122

Frances A. Rosamond, Federico Mancini, Michael R. Fellows, Charis Papadopoulos, Pinar Heggernes, Hans L. Bodlaender

Publication date: 3 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-85238-4_11

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

Complexity issues for the sandwich homogeneous set problem, Clustering with partial information, Clustering with Partial Information, Constant ratio fixed-parameter approximation of the edge multicut problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Correlation clustering
• Graph-modeled data clustering: Exact algorithms for clique generation
• NP-hard problems in hierarchical-tree clustering
• Fixed-parameter tractability of graph modification problems for hereditary properties
• Cluster graph modification problems
• Correlation clustering in general weighted graphs
• Clustering with qualitative information
• Applying Modular Decomposition to Parameterized Bicluster Editing
• The Cluster Editing Problem: Implementations and Experiments
• The Lost Continent of Polynomial Time: Preprocessing and Kernelization
• Clustering with Partial Information
• A More Effective Linear Kernelization for Cluster Editing
• Computing Phylogenetic Roots with Bounded Degrees and Errors
• Graph Sandwich Problems
• Data Reduction, Exact, and Heuristic Algorithms for Clique Cover
• Parameterized and Exact Computation
• Efficient Parameterized Preprocessing for Cluster Editing
• Algorithms - ESA 2003
• Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques