Multi-source spanning trees: algorithms for minimizing source eccentricities

H. Brendan McMahan; Andrzej Proskurowski

首页> 外文期刊>Discrete Applied Mathematics >Multi-source spanning trees: algorithms for minimizing source eccentricities

【24h】

Multi-source spanning trees: algorithms for minimizing source eccentricities

机译：多源生成树：最小化源偏心率的算法

获取原文

获取原文并翻译 | 示例

掌桥外文数据库（机构版） >>

开具论文收录证明 >>

文献代查 >>

页面导航

摘要
著录项
相似文献
相关主题

摘要

We present two efficient algorithms constructing a spanning tree with minimum eccentricity of a source, for a given graph with weighted edges and a set of source vertices. The first algorithm is both simpler to implement and faster of the two. The second approach involves enumerating single-source shortest-path spanning trees for all points on a graph, a technique that may be useful in solving other problems.

机译：对于具有加权边和一组源顶点的给定图，我们提出了两种有效的算法来构造具有最小源偏心率的生成树。第一种算法既易于实施，又速度更快。第二种方法涉及枚举图上所有点的单源最短路径生成树，该技术可能对解决其他问题很有用。

著录项

来源
《Discrete Applied Mathematics》 |2004年第2期|共10页
作者
H. Brendan McMahan; Andrzej Proskurowski;
展开▼
作者单位

展开▼
收录信息
原文格式 PDF
正文语种 eng
中图分类离散数学;
关键词
network; communications; multicast; graph; shortest-paths spanning trees; algorithm;

机译：网络;通信;多播;图;生成树的最短路径;算法;

相似文献

外文文献
中文文献
专利

1. Multi-source spanning trees: algorithms for minimizing source eccentricities [J] . H. Brendan McMahan, Andrzej Proskurowski Discrete Applied Mathematics . 2004,第2期

机译：多源生成树：最小化源偏心率的算法
2. Applying tree-based ensemble algorithms to the classification of ecological zones using multi-temporal multi-source remote-sensing data [J] . XIN MIAO, JILL S. HEATON, SONGFENG ZHENG, International journal of remote sensing . 2012,第5a6期

机译：基于树的集成算法在多时相多源遥感数据分类中的应用
3. Applying tree-based ensemble algorithms to the classification of ecological zones using multi-temporal multi-source remote-sensing data [J] . Xin Miaoa* Jill S. Heatonb Songfeng Zhengc David A. Charletd, Hui Liue International Journal of Remote Sensing . 2012,第6期

机译：基于树的集成算法在多时相多源遥感数据分类中的应用
4. Multi-source Trees: Algorithms for Minimizing Eccentricity Cost Metrics [C] . Paraskevi Fragopoulou, Stavros D. Nikolopoulos, Leonidas Palios International Symposium on Algorithms and Computation(ISAAC 2005); 20051219-21; Sanya(CN) . 2005

机译：多源树：最小化偏心成本度量的算法
5. Design and implementation of parallel graph algorithms for minimum spanning tree, list ranking, and root finding on trees. [D] . Chung, Sun Bong. 1998

机译：并行图算法的设计和实现，用于最小生成树，列表排序和树的根查找。
6. Stochastic Proximal Gradient Algorithms for Multi-Source Quantitative Photoacoustic Tomography [O] . Simon Rabanser, Lukas Neumann, Markus Haltmeier 2018

机译：用于多源定量光声断层扫描的随机近端梯度算法
7. Multi-source spanning trees: algorithms for minimizing source eccentricities [O] . McMahan H.Brendan, Proskurowski Andrzej 2004

机译：多源生成树：用于最小化源偏心率的算法

Multi-source spanning trees: algorithms for minimizing source eccentricities

摘要

著录项

相似文献

相关主题

期刊订阅