Pages that link to "Item:Q2257301"
From MaRDI portal
The following pages link to Edge deletion problems: branching facilitated by modular decomposition (Q2257301):
Displaying 14 items.
- Approximate association via dissociation (Q505447) (← links)
- Unit interval editing is fixed-parameter tractable (Q515577) (← links)
- On the threshold of intractability (Q2051847) (← links)
- Improved kernel and algorithm for claw and diamond free edge deletion based on refined observations (Q2077398) (← links)
- (Sub)linear kernels for edge modification problems toward structured graph classes (Q2093576) (← links)
- Fixed-treewidth-efficient algorithms for edge-deletion to interval graph classes (Q2232241) (← links)
- An effective branching strategy based on structural relationship among multiple forbidden induced subgraphs (Q2354311) (← links)
- Tree-edges deletion problems with bounded diameter obstruction sets (Q2370427) (← links)
- Bounded search tree algorithms for parametrized cograph deletion: efficient branching rules by exploiting structures of special graph classes (Q2905308) (← links)
- A Novel Branching Strategy for Parameterized Graph Modification Problems (Q3066469) (← links)
- Removing null branches in a transfinite network (Q4835382) (← links)
- Node-and edge-deletion NP-complete problems (Q5402565) (← links)
- A survey of parameterized algorithms and the complexity of edge modification (Q6158862) (← links)
- A faster parameterized algorithm for bipartite 1-sided vertex explosion (Q6606237) (← links)