Pages that link to "Item:Q3511432"
From MaRDI portal
The following pages link to Minimum Leaf Out-Branching Problems (Q3511432):
Displaying 9 items.
- On the directed full degree spanning tree problem (Q456701) (← links)
- Complexity evaluation of benchmark instances for the \(p\)-median problem (Q636452) (← links)
- A new algorithm for finding trees with many leaves (Q652536) (← links)
- On complexity of minimum leaf out-branching problem (Q967352) (← links)
- Algorithm for finding \(k\)-vertex out-trees and its application to \(k\)-internal out-branching problem (Q988577) (← links)
- Balanced branchings in digraphs (Q2354769) (← links)
- Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems (Q2839214) (← links)
- Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree (Q3541089) (← links)
- Algorithm for Finding k-Vertex Out-trees and Its Application to k-Internal Out-branching Problem (Q5323046) (← links)
