Pages that link to "Item:Q1882409"
From MaRDI portal
The following pages link to Automated generation of search tree algorithms for hard graphs modification problems (Q1882409):
Displayed 42 items.
- A fast branching algorithm for cluster vertex deletion (Q255285) (← links)
- A \(2k\) kernel for the cluster editing problem (Q414871) (← links)
- On making directed graphs transitive (Q414917) (← links)
- Confronting intractability via parameters (Q465686) (← links)
- Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions (Q494805) (← links)
- Branch-and-cut approaches for \(p\)-cluster editing (Q505422) (← links)
- An improved parameterized algorithm for the \(p\)-cluster vertex deletion problem (Q511682) (← links)
- Exact algorithms for cluster editing: Evaluation and experiments (Q534775) (← links)
- Complexity and parameterized algorithms for cograph editing (Q690461) (← links)
- Parameterized enumeration, transversals, and imperfect phylogeny reconstruction (Q820146) (← links)
- A top-down approach to search-trees: Improved algorithmics for 3-hitting set (Q848640) (← links)
- Fixed-parameter enumerability of cluster editing and related problems (Q970105) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Going weighted: parameterized algorithms for cluster editing (Q1040589) (← links)
- Parameterizing edge modification problems above lower bounds (Q1635817) (← links)
- A golden ratio parameterized algorithm for cluster editing (Q1932356) (← links)
- Even faster parameterized cluster deletion and cluster editing (Q1944120) (← links)
- Branch-and-price for \(p\)-cluster editing (Q2013143) (← links)
- Even better fixed-parameter algorithms for bicluster editing (Q2019506) (← links)
- Polyhedral properties of the induced cluster subgraphs (Q2022509) (← links)
- Faster parameterized algorithm for cluster vertex deletion (Q2035480) (← links)
- A simple and improved parameterized algorithm for bicluster editing (Q2059879) (← links)
- Cluster deletion revisited (Q2234801) (← links)
- Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
- Triangle edge deletion on planar glasses-free RGB-digraphs (Q2317352) (← links)
- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs (Q2354311) (← links)
- Parameterized algorithms for min-max 2-cluster editing (Q2410027) (← links)
- On Generating Triangle-Free Graphs (Q2839211) (← links)
- BOUNDED SEARCH TREE ALGORITHMS FOR PARAMETRIZED COGRAPH DELETION: EFFICIENT BRANCHING RULES BY EXPLOITING STRUCTURES OF SPECIAL GRAPH CLASSES (Q2905308) (← links)
- Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs (Q3057623) (← links)
- THE COMPUTATIONAL COMPLEXITY OF AVOIDING FORBIDDEN SUBMATRICES BY ROW DELETIONS (Q3421857) (← links)
- Speeding up Exact Algorithms With High Probability (Q3439468) (← links)
- Exact Algorithms for Cluster Editing: Evaluation and Experiments (Q3506417) (← links)
- Bounded-Degree Techniques Accelerate Some Parameterized Graph Algorithms (Q3656854) (← links)
- Cluster Editing (Q5326357) (← links)
- Fixed-Parameter Algorithms for Cluster Vertex Deletion (Q5458573) (← links)
- Going Weighted: Parameterized Algorithms for Cluster Editing (Q5505638) (← links)
- Chordless Cycle Packing Is Fixed-Parameter Tractable (Q5874543) (← links)
- An improved fixed-parameter algorithm for 2-Club Cluster Edge Deletion (Q6038703) (← links)
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs (Q6039419) (← links)
- Algorithms for 2-club cluster deletion problems using automated generation of branching rules (Q6140356) (← links)
- \(s\)-club cluster vertex deletion on interval and well-partitioned chordal graphs (Q6145821) (← links)