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