Pages that link to "Item:Q1885821"
From MaRDI portal
The following pages link to Cluster graph modification problems (Q1885821):
Displaying 50 items.
- Reducing rank of the adjacency matrix by graph modification (Q344771) (← links)
- Polynomial kernels for proper interval completion and related problems (Q393083) (← links)
- The cluster deletion problem for cographs (Q394219) (← links)
- 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)
- Graph clustering (Q458448) (← links)
- Finding the closest ultrametric (Q476304) (← links)
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (Q494805) (← links)
- A faster algorithm for the cluster editing problem on proper interval graphs (Q495665) (← links)
- Complexity of the cluster deletion problem on subclasses of chordal graphs (Q496003) (← links)
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
- Cost-optimal constrained correlation clustering via weighted partial maximum satisfiability (Q511772) (← links)
- Exact algorithms for cluster editing: Evaluation and experiments (Q534775) (← links)
- Polynomial kernels for 3-leaf power graph modification problems (Q602747) (← links)
- Hardness of subgraph and supergraph problems in \(c\)-tournaments (Q638528) (← links)
- Editing graphs into disjoint unions of dense clusters (Q652530) (← links)
- Cluster editing with locally bounded modifications (Q713321) (← links)
- Graph-modeled data clustering: Exact algorithms for clique generation (Q814914) (← links)
- On the effectiveness of the incremental approach to minimal chordal edge modification (Q820555) (← links)
- Combining clickstream analyses and graph-modeled data clustering for identifying common response processes (Q823870) (← links)
- Sufficient conditions for edit-optimal clusters (Q903364) (← links)
- Approximation algorithms for bounded degree phylogenetic roots (Q926287) (← links)
- Optimal clustering of multipartite graphs (Q947074) (← 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)
- Hardness of edge-modification problems (Q1034612) (← links)
- Going weighted: parameterized algorithms for cluster editing (Q1040589) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Cluster editing problem for points on the real line: a polynomial time algorithm (Q1675767) (← links)
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
- New heuristics for the bicluster editing problem (Q1686528) (← links)
- Cluster editing: kernelization based on edge cuts (Q1759680) (← links)
- Even faster parameterized cluster deletion and cluster editing (Q1944120) (← links)
- On the (non-)existence of polynomial kernels for \(P _{l }\)-free edge modification problems (Q1949740) (← links)
- Clustering with local restrictions (Q1951587) (← links)
- On the parameterized complexity of consensus clustering (Q2015135) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Correlation clustering in data streams (Q2037102) (← links)
- Cluster deletion on interval graphs and split related graphs (Q2037103) (← links)
- Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs (Q2039649) (← links)
- Indirect identification of horizontal gene transfer (Q2040274) (← links)
- On the threshold of intractability (Q2051847) (← links)
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis (Q2079285) (← links)
- A new temporal interpretation of cluster editing (Q2169957) (← links)
- The maximum independent union of cliques problem: complexity and exact approaches (Q2174276) (← links)
- Subexponential algorithm for \(d\)-cluster edge deletion: exception or rule? (Q2186825) (← links)
- Exact-2-relation graphs (Q2197422) (← links)
