Pages that link to "Item:Q3449846"
From MaRDI portal
The following pages link to A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846):
Displaying 13 items.
- Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- Representative families: a unified tradeoff-based approach (Q899582) (← links)
- An approximation algorithm for maximum internal spanning tree (Q1743498) (← links)
- Algorithms for maximum internal spanning tree problem for some graph classes (Q2091107) (← links)
- A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
- Reoptimization of parameterized problems (Q2170282) (← links)
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q2232252) (← links)
- Spotting Trees with Few Leaves (Q3448789) (← links)
- Mixing Color Coding-Related Techniques (Q3452864) (← links)
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q5049994) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)
- Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671) (← links)
