Pages that link to "Item:Q653320"
From MaRDI portal
The following pages link to An exact algorithm for the maximum leaf spanning tree problem (Q653320):
Displaying 18 items.
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem (Q450578) (← links)
- A 2-approximation algorithm for finding a spanning tree with maximum number of leaves (Q513269) (← links)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
- An exact algorithm for the maximum leaf spanning tree problem. (Q1413822) (← links)
- The \(k\)-leaf spanning tree problem admits a klam value of 39 (Q1678098) (← links)
- Regenerator location problem: polyhedral study and effective branch-and-cut algorithms (Q1752767) (← links)
- Inclusion/exclusion meets measure and conquer (Q2249747) (← links)
- On connected dominating sets of restricted diameter (Q2356248) (← links)
- Computing the differential of a graph: hardness, approximability and exact algorithms (Q2448922) (← links)
- Benders Decomposition, Branch-and-Cut, and Hybrid Algorithms for the Minimum Connected Dominating Set Problem (Q2940057) (← links)
- (Q2992654) (← links)
- (Q3581682) (← links)
- Below All Subsets for Minimal Connected Dominating Set (Q4683902) (← links)
- Efficient Local Search based on Dynamic Connectivity Maintenance for Minimum Connected Dominating Set (Q4989343) (← links)
- Robust Connectivity of Graphs on Surfaces (Q5084099) (← links)
- Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights (Q5894785) (← links)
- Kernelization for Maximum Leaf Spanning Tree with Positive Vertex Weights (Q5900911) (← links)
