Pages that link to "Item:Q988577"

The following pages link to Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577):

Displaying 23 items.

• Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← links)
• Beyond bidimensionality: parameterized subexponential algorithms on directed graphs (Q391650) (← links)
• Faster algorithms for finding and counting subgraphs (Q439930) (← links)
• 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)
• Designing deterministic polynomial-space algorithms by color-coding multivariate polynomials (Q1747489) (← links)
• Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← 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)
• A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
• Sharp separation and applications to exact and parameterized algorithms (Q2429363) (← 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)
• Spotting Trees with Few Leaves (Q3448789) (← links)
• A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← 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)
• (Q5075762) (← links)
• Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem (Q5323046) (← links)
• Spotting Trees with Few Leaves (Q5346548) (← links)
• Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671) (← links)