Pages that link to "Item:Q2904547"
From MaRDI portal
The following pages link to Faster Parameterized Algorithms for Deletion to Split Graphs (Q2904547):
Displaying 9 items.
- Obtaining split graphs by edge contraction (Q897961) (← links)
- Deleting edges to restrict the size of an epidemic: a new application for treewidth (Q1635713) (← links)
- A simplified \(\widetilde{O}(nm)\) time edge-splitting algorithm in undirected graphs (Q1969943) (← links)
- Faster FPT algorithms for deletion to pairs of graph classes (Q2140510) (← links)
- Polynomial kernelization for removing induced claws and diamonds (Q2398208) (← links)
- Faster parameterized algorithm for pumpkin vertex deletion set (Q2414055) (← links)
- Polynomial Kernelization for Removing Induced Claws and Diamonds (Q2827828) (← links)
- Deleting Edges to Restrict the Size of an Epidemic: A New Application for Treewidth (Q3467872) (← links)
- Vertex deletion on split graphs: beyond 4-hitting set (Q5919400) (← links)