scientific article; zbMATH DE number 2011849
zbMATH Open1032.68158MaRDI QIDQ4437501FDOQ4437501
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
Title of this publication is not available (Why is that?)
Recommendations
exact algorithmsfixed-parameter tractabilityNP-complete problemsdata clusteringedge modification problems
Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Nonnumerical algorithms (68W05)
Cited In (34)
- Fixed-Parameter Tractable Generalizations of Cluster Editing
- The cluster deletion problem for cographs
- Fixed-Parameter Algorithms for Graph-Modeled Date Clustering
- Graph-based data clustering with overlaps
- Fixed-parameter algorithms for cluster vertex deletion
- Applying Modular Decomposition to Parameterized Bicluster Editing
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion
- Branch-and-price for \(p\)-cluster editing
- Cutting a tree with subgraph complementation is hard, except for some small trees
- Graph-modeled data clustering: Exact algorithms for clique generation
- Even better fixed-parameter algorithms for bicluster editing
- Cutting a tree with subgraph complementation is hard, except for some small trees
- Clustering with local restrictions
- Even faster parameterized cluster deletion and cluster editing
- Alternative parameterizations for cluster editing
- \( \gamma \)-clustering problems: classical and parametrized complexity
- Applying modular decomposition to parameterized cluster editing problems
- Lower bounds on kernelization
- 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
- Title not available (Why is that?)
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
- Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule?
- Incompressibility of \(H\)-free edge modification problems: towards a dichotomy
- A More Relaxed Model for Graph-Based Data Clustering: s-Plex Editing
- Branch-and-cut approaches for \(p\)-cluster editing
- Title not available (Why is that?)
- 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)
