Pages that link to "Item:Q2942652"
From MaRDI portal
The following pages link to Approximating the Maximum Internal Spanning Tree Problem via a Maximum Path-Cycle Cover (Q2942652):
Displaying 10 items.
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- An approximation algorithm for maximum internal spanning tree (Q1743498) (← 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)
- Better approximation algorithms for maximum weight internal spanning trees in cubic graphs and claw-free graphs (Q2232252) (← 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 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)
- Approximation algorithms for the maximum weight internal spanning tree problem (Q5919671) (← links)