scientific article; zbMATH DE number 2011849

MaRDI QIDQ4437501zbMATHFDO

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)

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

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)