Abordagem de refinamento iterativo para o problema da árvore geradora com número mínimo de vértices Branch
=== Given a connected, undirected, unweighted graph G=(V,E) the Minimum Branch Vertices Problem (MBV) consists in finding a spanning tree T of G that contains the minimum number of vertices with degree greater than or equal to 3, also called branch vertices. This problem arises in the design of opt...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | English |
| Published: |
Universidade Federal de Minas Gerais
2011
|
| Online Access: | http://hdl.handle.net/1843/SLSS-8GQJHW |