Adding Edges for Maximizing Weighted Reachability
In this paper, we consider the problem of improving the reachability of a graph. We approach the problem from a graph augmentation perspective, in which a limited set size of edges is added to the graph to increase the overall number of reachable nodes. We call this new problem the <i>Maximum...
| الحاوية / القاعدة: | Algorithms |
|---|---|
| المؤلفون الرئيسيون: | , , |
| التنسيق: | مقال |
| اللغة: | الإنجليزية |
| منشور في: |
MDPI AG
2020-03-01
|
| الموضوعات: | |
| الوصول للمادة أونلاين: | https://www.mdpi.com/1999-4893/13/3/68 |