Pages that link to "Item:Q2905308"
From MaRDI portal
The following pages link to Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes (Q2905308):
Displaying 12 items.
- Spiders can be recognized by counting their legs (Q904532) (← links)
- On polynomial kernelization of \(\mathcal H\)-\textsc{free edge deletion} (Q1679221) (← links)
- Linear-time minimal cograph editing (Q2140496) (← links)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
- Edge deletion problems: branching facilitated by modular decomposition (Q2257301) (← links)
- Faster algorithms for cograph edge modification problems (Q2308466) (← links)
- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs (Q2354311) (← links)
- Parameterized algorithms for edge biclique and related problems (Q2636505) (← links)
- A Novel Branching Strategy for Parameterized Graph Modification Problems (Q3066469) (← links)
- Defining and identifying cograph communities in complex networks (Q3387608) (← links)
- Hierarchical and modularly-minimal vertex colorings (Q5058209) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
