Clustering with partial information
From MaRDI portal
Publication:2268879
DOI10.1016/j.tcs.2009.12.016zbMath1213.05222OpenAlexW4213048784WikidataQ57359734 ScholiaQ57359734MaRDI QIDQ2268879
Pinar Heggernes, Charis Papadopoulos, Federico Mancini, Michael R. Fellows, Frances A. Rosamond, Hans L. Bodlaender
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
Graph algorithms (graph-theoretic aspects) (05C85) Graph operations (line graphs, products, etc.) (05C76) Fractional graph theory, fuzzy graph theory (05C72)
Related Items
Tight bounds for parameterized complexity of cluster editing with a small number of clusters ⋮ Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Correlation clustering
- Graph-modeled data clustering: Exact algorithms for clique generation
- Going weighted: parameterized algorithms for cluster editing
- 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 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
- Recent developments in maximum flow algorithms
- Parameterized and Exact Computation
- Efficient Parameterized Preprocessing for Cluster Editing
- Algorithms - ESA 2003
- Aggregating inconsistent information
- Approximation, Randomization, and Combinatorial Optimization.. Algorithms and Techniques
