Pages that link to "Item:Q1352005"
From MaRDI portal
The following pages link to Fixed-parameter tractability of graph modification problems for hereditary properties (Q1352005):
Displayed 34 items.
- A linear-time algorithm for computing the intersection of all odd cycles in a graph (Q674917) (← links)
- Minimal triangulations of graphs: a survey (Q819823) (← links)
- Parameterized coloring problems on chordal graphs (Q820152) (← links)
- Fixed-parameter complexity of minimum profile problems (Q958202) (← links)
- Minimum fill-in and treewidth of split \(+ ke\) and split \(+kv\) graphs (Q972334) (← links)
- Characterizing and computing minimal cograph completions (Q972335) (← links)
- Chordal deletion is fixed-parameter tractable (Q973007) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Closest 4-leaf power is fixed-parameter tractable (Q1003724) (← links)
- Dynamically maintaining split graphs (Q1026107) (← links)
- Parameterized complexity of finding regular induced subgraphs (Q1026227) (← links)
- Parameterized complexity of vertex colouring (Q1811065) (← links)
- Parameterized complexity of finding subgraphs with hereditary properties. (Q1853579) (← links)
- Clustering with partial information (Q2268879) (← links)
- Applying modular decomposition to parameterized cluster editing problems (Q2272201) (← links)
- Parameterized complexity of the induced subgraph problem in directed graphs (Q2380001) (← links)
- Additive approximation for edge-deletion problems (Q2389218) (← links)
- On the interval completion of chordal graphs (Q2492201) (← links)
- Fast fixed-parameter tractable algorithms for nontrivial generalizations of vertex cover (Q2576350) (← links)
- Generalized Graph Clustering: Recognizing (p,q)-Cluster Graphs (Q3057623) (← links)
- On the (Non-)existence of Polynomial Kernels for P l -free Edge Modification Problems (Q3058699) (← links)
- Proper Interval Vertex Deletion (Q3058706) (← links)
- An Improved Fixed-Parameter Algorithm for Minimum-Flip Consensus Trees (Q3503577) (← links)
- Wheel-Free Deletion Is W[2]-Hard (Q3503585) (← links)
- Characterizing and Computing Minimal Cograph Completions (Q3507328) (← links)
- Obtaining a Planar Graph by Vertex Deletion (Q3508576) (← links)
- Clustering with Partial Information (Q3599122) (← links)
- Two Edge Modification Problems without Polynomial Kernels (Q3656868) (← links)
- Graph-Based Data Clustering with Overlaps (Q5323099) (← links)
- Minimum Fill-In and Treewidth of Split+ ke and Split+ kv Graphs (Q5387822) (← links)
- Problem Kernels for NP-Complete Edge Deletion Problems: Split and Related Graphs (Q5387826) (← links)
- Parameterized Graph Editing with Chosen Vertex Degrees (Q5505639) (← links)
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems (Q5895104) (← links)
- Complexity classification of some edge modification problems (Q5948964) (← links)