Zobrazeno 1 - 1
of 1
pro vyhledávání: '"Yael Maduel"'
Autor:
Yael Maduel, Zeev Nutov
Publikováno v:
Discrete Applied Mathematics. (13):1424-1432
The Tree Augmentation Problem (TAP) is: given a tree T=(V,E) and a set E of edges (called links) on V disjoint to E, find a minimum-size edge-subset [email protected]?E such that T+F is 2-edge-connected. TAP is equivalent to the problem of finding a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4e71abac6c5fdf2afa6dfe39e489e368
