Pages that link to "Item:Q5894785"
From MaRDI portal
The following pages link to Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights (Q5894785):
Displaying 6 items.
- A \(9k\) kernel for nonseparating independent set in planar graphs (Q385964) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← links)
- Kernel(s) for problems with no kernel (Q3189081) (← links)
- Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights (Q5900911) (← links)
- Leafy spanning arborescences in DAGs (Q5970768) (← links)