Pages that link to "Item:Q4887748"
From MaRDI portal
The following pages link to Complexity of spanning tree problems with leaf-dependent objectives (Q4887748):
Displaying 5 items.
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs (Q264582) (← links)
- Memory-efficient enumeration of constrained spanning trees (Q294700) (← links)
- Complexities of some interesting problems on spanning trees (Q1041729) (← links)
- Relations, models and a memetic approach for three degree-dependent spanning tree problems (Q2255965) (← links)
- Complexity of independency and cliquy trees (Q2283099) (← links)