Pages that link to "Item:Q2380066"
From MaRDI portal
The following pages link to On finding spanning trees with few leaves (Q2380066):
Displayed 18 items.
- Exact and heuristic solutions for the minimum number of branch vertices spanning tree problem (Q319657) (← links)
- Spanning trees: A survey (Q659663) (← links)
- Deeper local search for parameterized and approximation algorithms for maximum internal spanning tree (Q729821) (← links)
- Approximating the maximum internal spanning tree problem (Q1034535) (← links)
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems (Q1694405) (← links)
- An approximation algorithm for maximum internal spanning tree (Q1743498) (← links)
- Depth first search in claw-free graphs (Q1744633) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965) (← links)
- Approximating spanning trees with few branches (Q2344216) (← links)
- Better approximation algorithms for the maximum internal spanning tree problem (Q2350897) (← links)
- Cutting-plane-based algorithms for two branch vertices related spanning tree problems (Q2357824) (← links)
- On spanning cycles, paths and trees (Q2446869) (← links)
- Solving the maximum internal spanning tree problem on interval graphs in polynomial time (Q2636496) (← links)
- (Q2861557) (← links)
- Better Approximation Algorithms for the Maximum Internal Spanning Tree Problem (Q3183476) (← links)
- A 2k-vertex Kernel for Maximum Internal Spanning Tree (Q3449846) (← links)
- A Polynomial Time Algorithm for Finding a Spanning Tree with Maximum Number of Internal Vertices on Interval Graphs (Q4632175) (← links)