scientific article; zbMATH DE number 2011849

MaRDI QIDQ4437501zbMATH OpenFDO

Authors Jens Gramm, Jiong Guo, Falk Hüffner, Rolf Niedermeier

Publication date 2 December 2003

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2653/26530108.htm

zbMATH Keywords

exact algorithmsfixed-parameter tractabilityNP-complete problemsdata clusteringedge modification problems

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05)

Recommendations

• Graph-modeled data clustering: Exact algorithms for clique generation
• Alternative parameterizations for cluster editing
• Cluster graph modification problems
• scientific article; zbMATH DE number 1953109
• Cluster editing with locally bounded modifications

Cited in

(37)

• The cluster deletion problem for cographs
• Fixed-Parameter Tractable Generalizations of Cluster Editing
• Fixed-Parameter Algorithms for Graph-Modeled Date Clustering
• Graph-based data clustering with overlaps
• Fixed-parameter algorithms for cluster vertex deletion
• Parameterized algorithms for min-max 2-cluster editing
• Applying Modular Decomposition to Parameterized Bicluster Editing
• Branch-and-price for \(p\)-cluster editing
• Cluster deletion revisited
• An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
• On 2-clubs in graph-based data clustering: theory and algorithm engineering
• Graph-modeled data clustering: Exact algorithms for clique generation
• Cutting a tree with subgraph complementation is hard, except for some small trees
• Even better fixed-parameter algorithms for bicluster editing
• Clustering with local restrictions
• Cutting a tree with subgraph complementation is hard, except for some small trees
• Even faster parameterized cluster deletion and cluster editing
• Alternative parameterizations for cluster editing
• Lower bounds on kernelization
• Applying modular decomposition to parameterized cluster editing problems
• \( \gamma \)-clustering problems: classical and parametrized complexity
• Clustering with partial information
• Structural parameterization of cluster deletion
• Clustering with qualitative information
• Fixed-parameter enumerability of cluster editing and related problems
• On parameterized and kernelization algorithms for the hierarchical clustering problem
• Improved kernelization and fixed-parameter algorithms for bicluster editing
• Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
• scientific article; zbMATH DE number 1953109 (Why is no real title available?)
• Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule?
• Branch-and-cut approaches for \(p\)-cluster editing
• Incompressibility of \(H\)-free edge modification problems: towards a dichotomy
• A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
• scientific article; zbMATH DE number 7651211 (Why is no real title available?)
• Editing simple graphs
• Cluster graph modification problems
• Cluster editing problem for points on the real line: a polynomial time algorithm

This page was built for publication:

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