https://scholars.lib.ntu.edu.tw/handle/123456789/339638
標題: | The swap edges of a multiple-sources routing tree | 作者: | Wu, B.Y. Hsiao, C.Y. KUN-MAO CHAO |
關鍵字: | Algorithm; Graph; Optimization problem; Spanning tree; Swap edge | 公開日期: | 2008 | 卷: | 50 | 期: | 3 | 起(迄)頁: | 299-311 | 來源出版物: | Algorithmica (New York) | 摘要: | Let T be a spanning tree of a graph G and S ⊂ V(G) be a set of sources. The routing cost of T is the total distance from all sources to all vertices. For an edge e of T, the swap edge of e is the edge f minimizing the routing cost of the tree formed by replacing e with f. Given an undirected graph G and a spanning tree T of G, we investigate the problem of finding the swap edge for every tree edge. In this paper, we propose an O(mlog∈n+n 2)-time algorithm for the case of two sources and an O(mn)-time algorithm for the case of more than two sources, where m and n are the numbers of edges and vertices of G, respectively. © 2007 Springer Science+Business Media, LLC. |
URI: | https://www.scopus.com/inward/record.uri?eid=2-s2.0-38149023352&doi=10.1007%2fs00453-007-9080-z&partnerID=40&md5=a73af5cfc7f56664413d835f62baffec http://scholars.lib.ntu.edu.tw/handle/123456789/339638 |
ISSN: | 01784617 | DOI: | 10.1007/s00453-007-9080-z | SDG/關鍵字: | Optimization problem; Spanning trees; Swap edges; Algorithms; Edge detection; Number theory; Optimization; Problem solving; Trees (mathematics) |
顯示於: | 生醫電子與資訊學研究所 |
在 IR 系統中的文件,除了特別指名其著作權條款之外,均受到著作權保護,並且保留所有的權利。