An edge-swap heuristic for generating spanning trees with minimum number of branch vertices (Q2448195)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An edge-swap heuristic for generating spanning trees with minimum number of branch vertices |
scientific article |
Statements
An edge-swap heuristic for generating spanning trees with minimum number of branch vertices (English)
0 references
30 April 2014
0 references
constrained spanning trees
0 references
branch vertices
0 references
minimum branch vertices problem
0 references
heuristic
0 references
multi-start heuristic
0 references
edge swapping
0 references
