Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Shion Kato"'
Publikováno v:
Journal of Interconnection Networks. 22
The minimum stretch spanning tree problem for a connected graph [Formula: see text] is to find a spanning tree [Formula: see text] of [Formula: see text] such that the maximum distance in [Formula: see text] between two adjacent vertices of [Formula:
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::87821c325d28e7cfcc40e7665c0bd2e7
https://doi.org/10.1142/s0219265921500286
https://doi.org/10.1142/s0219265921500286
