ListarEstadística e Investigación Operativa por materia "Maximum closure"
Mostrando ítems 1-1 de 1
-
Artículo
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs
(Wiley, 2008)This paper deals with the following graph partitioning problem. Consider a connected graph with n nodes, p of which are ...