Pages that link to "Item:Q2861557"

The following pages link to A survey on algorithms for the maximum internal spanning tree and related problems (Q2861557):

Displaying 10 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)
• 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)
• Scatter search for the minimum leaf spanning tree problem (Q2147145) (← links)
• Better approximation algorithms for the maximum internal spanning tree problem (Q2350897) (← 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)
• Algorithms and Data Structures (Q5900777) (← links)