Graph-modeled data clustering: Exact algorithms for clique generation
From MaRDI portal
Publication:814914
DOI10.1007/s00224-004-1178-yzbMath1084.68117MaRDI QIDQ814914
Jens Gramm, Jiong Guo, Rolf Niedermeier, Falk Hüffner
Publication date: 8 February 2006
Published in: Theory of Computing Systems (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00224-004-1178-y
68R10: Graph theory (including graph drawing) in computer science
68T10: Pattern recognition, speech recognition
Related Items
On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering, Cluster Editing in Multi-Layer and Temporal Graphs., Parameterized Dynamic Cluster Editing, Graph-Based Data Clustering with Overlaps, Cluster Editing, Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs, Fixed-Parameter Algorithms for Cluster Vertex Deletion, Going Weighted: Parameterized Algorithms for Cluster Editing, Parameterized algorithms for module map problems, Efficient algorithms for cluster editing, \((1,1)\)-cluster editing is polynomial-time solvable, A survey of parameterized algorithms and the complexity of edge modification, A \(2k\) kernel for the cluster editing problem, On making directed graphs transitive, Graph-based data clustering with overlaps, Improved kernel results for some FPT problems based on simple observations, An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem, Exact algorithms for cluster editing: Evaluation and experiments, Polynomial kernels for 3-leaf power graph modification problems, Editing graphs into disjoint unions of dense clusters, Complexity and parameterized algorithms for cograph editing, Cluster editing with locally bounded modifications, Fixed-parameter enumerability of cluster editing and related problems, Fixed-parameter algorithms for cluster vertex deletion, Closest 4-leaf power is fixed-parameter tractable, A more effective linear kernelization for cluster editing, On problems without polynomial kernels, Going weighted: parameterized algorithms for cluster editing, On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion}, Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications, Cluster editing: kernelization based on edge cuts, A golden ratio parameterized algorithm for cluster editing, Even faster parameterized cluster deletion and cluster editing, Correlation clustering in data streams, A simple and improved parameterized algorithm for bicluster editing, Parameterized dynamic cluster editing, Cluster deletion revisited, Clustering with partial information, Applying modular decomposition to parameterized cluster editing problems, Incompressibility of \(H\)-free edge modification problems, On the complexity of multi-parameterized cluster editing, Parameterized algorithms for min-max 2-cluster editing, A cubic-vertex kernel for flip consensus tree, Tight bounds for parameterized complexity of cluster editing with a small number of clusters, Solving \#SAT using vertex covers, Kernel for \(K_t\)\textsc{-free Edge Deletion}, On 2-clubs in graph-based data clustering: theory and algorithm engineering, Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics, The Multi-parameterized Cluster Editing Problem, Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs, Cluster Editing: Kernelization Based on Edge Cuts, Alternative Parameterizations for Cluster Editing, On Making Directed Graphs Transitive, THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS, Improved Algorithms for Bicluster Editing, Exact Algorithms for Cluster Editing: Evaluation and Experiments, A Problem Kernelization for Graph Packing, Clustering with Partial Information, Iterative Compression for Exactly Solving NP-Hard Minimization Problems, Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms
