Pages that link to "Item:Q1936242"

The following pages link to A linear vertex kernel for maximum internal spanning tree (Q1936242):

Displaying 24 items.

• Parameterized algorithms for non-separating trees and branchings in digraphs (Q334949) (← 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)
• 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)
• Better approximation algorithms for the maximum internal spanning tree problem (Q2350897) (← links)
• A multivariate framework for weighted FPT algorithms (Q2402359) (← links)
• Towards optimal kernel for edge-disjoint triangle packing (Q2446590) (← 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)
• A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
• Mixing Color Coding-Related Techniques (Q3452864) (← links)
• A Linear Vertex Kernel for Maximum Internal Spanning Tree (Q3652213) (← links)
• A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (Q4632175) (← links)
• Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q5049994) (← links)
• (Q5075762) (← links)
• Spotting Trees with Few Leaves (Q5346548) (← links)
• Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights (Q5900911) (← links)
• Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671) (← links)