O problema do subgrafo biconexo mínimo generalizado: algoritmos e formulações
=== Given an integer number k > 2 and an undirected simple graph G = (V; E) with positive real weights assigned to its edges, where V is partitioned into k subsets (or clusters), the Generalized Minimum Biconnected Subgraph Problem (GMBSP) amounts to nding a minimum-cost biconnected subgraph S o...
| Main Author: | |
|---|---|
| Other Authors: | |
| Format: | Others |
| Language: | Portuguese |
| Published: |
Universidade Federal de Minas Gerais
2012
|
| Online Access: | http://hdl.handle.net/1843/ESBF-8SUMR5 |