Pages that link to "Item:Q3656859"
From MaRDI portal
The following pages link to An Exact Algorithm for the Maximum Leaf Spanning Tree Problem (Q3656859):
Displaying 10 items.
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- An exact algorithm for connected red-blue dominating set (Q635737) (← links)
- An exact algorithm for the maximum leaf spanning tree problem (Q653320) (← links)
- Reformulations and solution algorithms for the maximum leaf spanning tree problem (Q993702) (← links)
- Spanning trees with a constraint on the number of leaves. A new formulation (Q1652247) (← links)
- Exact and parameterized algorithms for \textsc{Max Internal Spanning Tree} (Q1939668) (← links)
- On independent sets and bicliques in graphs (Q2428684) (← links)
- An exact exponential time algorithm for \textsc{Power} \textsc{Dominating} \textsc{Set} (Q2429350) (← links)
- (Q2992654) (← links)
- (Q3581682) (← links)