Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Yonta, P. M."'
Given an undirected and connected graph G, with a non-negative weight on each edge, the Minimum Average Distance (MAD) spanning tree problem is to find a spanning tree of G which minimizes the average distance between pairs of vertices. This network
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=od_______932::90ab5ae62b53096b6072cc70118e968b
http://www.documentation.ird.fr/hor/fdi:010042590
http://www.documentation.ird.fr/hor/fdi:010042590
