Pages that link to "Item:Q2867096"

The following pages link to Algorithms for k-Internal Out-Branching (Q2867096):

Displaying 13 items.

• Algorithms for \(k\)-internal out-branching and \(k\)-tree in bounded degree graphs (Q527430) (← links)
• Representative families: a unified tradeoff-based approach (Q899582) (← links)
• A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
• A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
• Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496) (← links)
• A \(\frac{4}{3}\)-approximation algorithm for the maximum internal spanning tree problem (Q2656175) (← links)
• Discriminantal subset convolution: refining exterior-algebraic methods for parameterized algorithms (Q2672945) (← links)
• Spotting Trees with Few Leaves (Q3448789) (← links)
• A Multivariate Approach for Weighted FPT Algorithms (Q3452855) (← links)
• Mixing Color Coding-Related Techniques (Q3452864) (← links)
• A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (Q4632175) (← links)
• Exact Algorithms for the Minimum Load Spanning Tree Problem (Q5084607) (← links)
• Spotting Trees with Few Leaves (Q5346548) (← links)