Pages that link to "Item:Q1006044"
From MaRDI portal
The following pages link to A more effective linear kernelization for cluster editing (Q1006044):
Displaying 37 items.
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments (Q385516) (← 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)
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (Q494805) (← links)
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
- Exact algorithms for cluster editing: Evaluation and experiments (Q534775) (← links)
- Editing graphs into disjoint unions of dense clusters (Q652530) (← links)
- Cluster editing with locally bounded modifications (Q713321) (← links)
- On structural parameterizations of load coloring (Q831701) (← links)
- Going weighted: parameterized algorithms for cluster editing (Q1040589) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- Two edge modification problems without polynomial kernels (Q1662097) (← 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)
- A simple and improved parameterized algorithm for bicluster editing (Q2059879) (← links)
- On subgraph complementation to \(H\)-free Graphs (Q2088585) (← links)
- Parameterized dynamic cluster editing (Q2223691) (← links)
- Iterative compression and exact algorithms (Q2268862) (← links)
- Kernels for packing and covering problems (Q2272393) (← links)
- A new approximate cluster deletion algorithm for diamond-free graphs (Q2292150) (← links)
- A linear-time kernelization for the rooted \(k\)-leaf outbranching problem (Q2354724) (← links)
- On the complexity of multi-parameterized cluster editing (Q2407948) (← links)
- Parameterized algorithms for min-max 2-cluster editing (Q2410027) (← links)
- Tight bounds for parameterized complexity of cluster editing with a small number of clusters (Q2453563) (← links)
- On subgraph complementation to \(H\)-free graphs (Q2672430) (← links)
- The Multi-parameterized Cluster Editing Problem (Q2867127) (← links)
- Cluster Editing: Kernelization Based on Edge Cuts (Q3058692) (← links)
- Alternative Parameterizations for Cluster Editing (Q3075528) (← links)
- On Making Directed Graphs Transitive (Q3183483) (← links)
- Editing Graphs Into Few Cliques: Complexity, Approximation, and Kernelization Schemes (Q3449838) (← links)
- Destroying Bicolored $P_3$s by Deleting Few Edges (Q5038193) (← links)
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion (Q6038703) (← links)
- \((1,1)\)-cluster editing is polynomial-time solvable (Q6048436) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- On structural parameterizations of load coloring (Q6184323) (← links)
