Pages that link to "Item:Q2272201"

The following pages link to Applying modular decomposition to parameterized cluster editing problems (Q2272201):

Displaying 34 items.

• A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
• On making directed graphs transitive (Q414917) (← links)
• Parameterized complexity of the weighted independent set problem beyond graphs of bounded clique number (Q450563) (← links)
• Graph-based data clustering with overlaps (Q456688) (← links)
• A survey of the algorithmic aspects of modular decomposition (Q458504) (← links)
• Towards optimal and expressive kernelization for \(d\)-hitting set (Q486984) (← links)
• A faster algorithm for the cluster editing problem on proper interval graphs (Q495665) (← links)
• Branch-and-cut approaches for \(p\)-cluster editing (Q505422) (← links)
• Fixed-parameter algorithms for DAG partitioning (Q507587) (← links)
• Incremental problems in the parameterized complexity setting (Q519883) (← links)
• Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
• Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
• Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
• New heuristics for the bicluster editing problem (Q1686528) (← links)
• Orthology relations, symbolic ultrametrics, and cographs (Q1937881) (← links)
• Branch-and-price for \(p\)-cluster editing (Q2013143) (← links)
• The biclique partitioning polytope (Q2032987) (← links)
• Maximizing the strong triadic closure in split graphs and proper interval graphs (Q2197407) (← links)
• Complexity of modification problems for reciprocal best match graphs (Q2290642) (← links)
• A linear-time kernelization for the rooted \(k\)-leaf outbranching problem (Q2354724) (← 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)
• A cubic vertex-kernel for \textsc{Trivially Perfect Editing} (Q2696282) (← links)
• A parallel hybrid metaheuristic for bicluster editing (Q2811935) (← links)
• Simpler Linear-Time Kernelization for Planar Dominating Set (Q2891347) (← links)
• Alternative Parameterizations for Cluster Editing (Q3075528) (← links)
• On Making Directed Graphs Transitive (Q3183483) (← links)
• A Problem Kernelization for Graph Packing (Q3599088) (← links)
• Cograph editing: Merging modules is equivalent to editing P_4s (Q5121555) (← links)
• Graph-Based Data Clustering with Overlaps (Q5323099) (← links)
• Cluster Editing (Q5326357) (← links)
• On the relation of strong triadic closure and cluster deletion (Q5915591) (← links)
• Your rugby mates don't need to know your colleagues: triadic closure with edge colors (Q5918315) (← links)
• Efficient algorithms for cluster editing (Q5963626) (← links)