Complexity of spanning tree problems with leaf-dependent objectives
From MaRDI portal
Publication:4887748
Recommendations
- Complexity of the maximum leaf spanning tree problem on planar and regular graphs
- Spanning trees with constraints on the leaf degree
- The maximum-leaf spanning tree problem: Formulations and facets
- Approximation algorithms for the maximum leaf spanning tree problem on acyclic digraphs
- On spanning tree problems with multiple objectives
- An approximation algorithm for the maximum leaf spanning arborescence problem
- The complexity of the locally connected spanning tree problem
- Complexities of some interesting problems on spanning trees
- NP-completeness and degree restricted spanning trees
- Approximating Maximum Leaf Spanning Trees in Almost Linear Time
Cited in
(6)- Complexity of the maximum leaf spanning tree problem on planar and regular graphs
- Memory-efficient enumeration of constrained spanning trees
- The complexity of spanning tree problems involving graphical indices
- Complexity of independency and cliquy trees
- Relations, models and a memetic approach for three degree-dependent spanning tree problems
- Complexities of some interesting problems on spanning trees
This page was built for publication: Complexity of spanning tree problems with leaf-dependent objectives
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4887748)