Pages that link to "Item:Q814914"
From MaRDI portal
The following pages link to Graph-modeled data clustering: Exact algorithms for clique generation (Q814914):
Displayed 50 items.
- A \(2k\) kernel for the cluster editing problem (Q414871) (← links)
- On making directed graphs transitive (Q414917) (← links)
- Graph-based data clustering with overlaps (Q456688) (← links)
- Improved kernel results for some FPT problems based on simple observations (Q507431) (← links)
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
- Exact algorithms for cluster editing: Evaluation and experiments (Q534775) (← links)
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- Editing graphs into disjoint unions of dense clusters (Q652530) (← links)
- Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
- Cluster editing with locally bounded modifications (Q713321) (← links)
- Fixed-parameter enumerability of cluster editing and related problems (Q970105) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- A more effective linear kernelization for cluster editing (Q1006044) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- Going weighted: parameterized algorithms for cluster editing (Q1040589) (← links)
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
- Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications (Q1759678) (← links)
- Cluster editing: kernelization based on edge cuts (Q1759680) (← links)
- A golden ratio parameterized algorithm for cluster editing (Q1932356) (← links)
- Even faster parameterized cluster deletion and cluster editing (Q1944120) (← links)
- Correlation clustering in data streams (Q2037102) (← links)
- A simple and improved parameterized algorithm for bicluster editing (Q2059879) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← links)
- Cluster deletion revisited (Q2234801) (← links)
- Clustering with partial information (Q2268879) (← links)
- Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
- Incompressibility of \(H\)-free edge modification problems (Q2343091) (← links)
- On the complexity of multi-parameterized cluster editing (Q2407948) (← links)
- Parameterized algorithms for min-max 2-cluster editing (Q2410027) (← links)
- A cubic-vertex kernel for flip consensus tree (Q2441594) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- Solving \#SAT using vertex covers (Q2464035) (← links)
- Kernel for \(K_t\)\textsc{-free Edge Deletion} (Q2656346) (← links)
- On 2-clubs in graph-based data clustering: theory and algorithm engineering (Q2692726) (← links)
- Parameterized Algorithmics for Graph Modification Problems: On Interactions with Heuristics (Q2827798) (← links)
- The Multi-parameterized Cluster Editing Problem (Q2867127) (← links)
- Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs (Q3057623) (← links)
- Cluster Editing: Kernelization Based on Edge Cuts (Q3058692) (← links)
- Alternative Parameterizations for Cluster Editing (Q3075528) (← links)
- On Making Directed Graphs Transitive (Q3183483) (← links)
- THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS (Q3421857) (← links)
- Improved Algorithms for Bicluster Editing (Q3502668) (← links)
- Exact Algorithms for Cluster Editing: Evaluation and Experiments (Q3506417) (← links)
- A Problem Kernelization for Graph Packing (Q3599088) (← links)
- Clustering with Partial Information (Q3599122) (← links)
- Iterative Compression for Exactly Solving NP-Hard Minimization Problems (Q3637312) (← links)
- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms (Q3656854) (← links)
- On 2-Clubs in Graph-Based Data Clustering: Theory and Algorithm Engineering (Q5084692) (← links)
- Parameterized Dynamic Cluster Editing (Q5090987) (← links)