Pages that link to "Item:Q5431312"
From MaRDI portal
The following pages link to Mathematical Foundations of Computer Science 2003 (Q5431312):
Displaying 12 items.
- Improved bounds for spanning trees with many leaves (Q409458) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- FPT algorithms and kernels for the directed \(k\)-leaf problem (Q847265) (← links)
- On problems without polynomial kernels (Q1034099) (← links)
- The \(k\)-leaf spanning tree problem admits a klam value of 39 (Q1678098) (← links)
- On maximum leaf trees and connections to connected maximum cut problems (Q2410577) (← links)
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089) (← links)
- Spanning Trees with Many Leaves in Regular Bipartite Graphs (Q5387825) (← links)
- Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms (Q5458557) (← links)
- Better Algorithms and Bounds for Directed Maximum Leaf Problems (Q5458844) (← links)
