scientific article; zbMATH DE number 2011849
From MaRDI portal
Publication:4437501
zbMath1032.68158MaRDI QIDQ4437501
Falk Hüffner, Jens Gramm, Jiong Guo, Rolf Niedermeier
Publication date: 2 December 2003
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/2653/26530108.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
NP-complete problemsdata clusteringfixed-parameter tractabilityexact algorithmsedge modification problems
Nonnumerical algorithms (68W05) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)
Related Items (13)
Cluster editing problem for points on the real line: a polynomial time algorithm ⋮ The cluster deletion problem for cographs ⋮ An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion ⋮ Structural parameterization of cluster deletion ⋮ Cutting a tree with subgraph complementation is hard, except for some small trees ⋮ Unnamed Item ⋮ Lower bounds on kernelization ⋮ Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions ⋮ Branch-and-cut approaches for \(p\)-cluster editing ⋮ Branch-and-price for \(p\)-cluster editing ⋮ Even better fixed-parameter algorithms for bicluster editing ⋮ Incompressibility of \(H\)-free edge modification problems: towards a dichotomy ⋮ Clustering with qualitative information
This page was built for publication:
