An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices (Q2374371)
From MaRDI portal
![]() | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices |
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices |
scientific article |
Statements
An effective decomposition approach and heuristics to generate spanning trees with a small number of branch vertices (English)
0 references
15 December 2016
0 references
minimum branch vertices
0 references
spanning tree
0 references
graph decomposition
0 references
heuristics
0 references
branch and cut
0 references
combinatorial optimization
0 references
0 references
0 references