Pages that link to "Item:Q1939668"
From MaRDI portal
The following pages link to Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668):
Displaying 28 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)
- On the number of connected sets in bounded degree graphs (Q1627210) (← links)
- The \(k\)-leaf spanning tree problem admits a klam value of 39 (Q1678098) (← links)
- An approximation algorithm for maximum internal spanning tree (Q1743498) (← links)
- Depth first search in claw-free graphs (Q1744633) (← links)
- Exact algorithms for counting 3-colorings of graphs (Q2081467) (← 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)
- A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q2232252) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← links)
- Better approximation algorithms for the maximum internal spanning tree problem (Q2350897) (← 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)
- On the Number of Connected Sets in Bounded Degree Graphs (Q2945202) (← links)
- Leaf-Critical and Leaf-Stable Graphs (Q2978184) (← 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)
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q5049994) (← links)
- Exact Algorithms for the Minimum Load Spanning Tree Problem (Q5084607) (← links)
- Spotting Trees with Few Leaves (Q5346548) (← links)
- Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671) (← links)
