Pages that link to "Item:Q2374371"
From MaRDI portal
The following pages link to An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices (Q2374371):
Displayed 6 items.
- A branch-and-cut algorithm for the minimum branch vertices spanning tree problem (Q1652257) (← links)
- Decomposition methods based on articulation vertices for degree-dependent spanning tree problems (Q1694405) (← links)
- An exact and heuristic approach for the \(d\)-minimum branch vertices problem (Q1756586) (← links)
- Spanning Trees with Few Branch Vertices (Q5232165) (← links)
- Maximum weighted induced forests and trees: new formulations and a computational comparative review (Q6071056) (← links)
- Spanning trees with few branch vertices in graphs of bounded neighborhood diversity (Q6148080) (← links)