On the finding 2-(k,l)-core of a tree with arbitrary real weight
Let T = (V, E) be a tree with | V |= n. A 2-(k, l)-core of T is two subtrees with at most k leaves and with a diameter of at most l, which the sum of the distances from all vertices to these subtrees is minimized. In this paper, we first investigate the problem of finding 2-(k, l)-core on an unweigh...
| Những tác giả chính: | , |
|---|---|
| Định dạng: | Bài viết |
| Ngôn ngữ: | English |
| Được phát hành: |
Ferdowsi University of Mashhad
2019-03-01
|
| Loạt: | Iranian Journal of Numerical Analysis and Optimization |
| Những chủ đề: | |
| Truy cập trực tuyến: | https://ijnao.um.ac.ir/article_24787_186bfec924d7eddc3d86bc2cfda26488.pdf |