A New Characterization of Tree Medians with Applications to Distributed Algorithms
暂无分享,去创建一个
[1] J. A. Bondy,et al. Graph Theory with Applications , 1978 .
[2] Peter J. Slater,et al. Centers to centroids in graphs , 1978, J. Graph Theory.
[3] Michael C. Loui. The Complexity of Sorting on Distributed Systems , 1984, Inf. Control..
[4] Ouri Wolfson,et al. The multicast policy and its relationship to replicated data placement , 1991, TODS.
[5] Nicola Santoro,et al. Distributed algorithms for finding centers and medians in networks , 1984, TOPL.
[6] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. II: The p-Medians , 1979 .
[7] Pierre A. Humblet,et al. A Distributed Algorithm for Minimum-Weight Spanning Trees , 1979, TOPL.
[8] S. L. Hakimi,et al. Optimum Locations of Switching Centers and the Absolute Centers and Medians of a Graph , 1964 .
[9] Bohdan Zelinka,et al. Medians and peripherians of trees , 1968 .
[10] K. Brooks Reid. Centroids to centers in trees , 1991, Networks.
[11] O. Kariv,et al. An Algorithmic Approach to Network Location Problems. I: The p-Centers , 1979 .
[12] Elwood S. Buffa,et al. Graph Theory with Applications , 1977 .
[13] C. Jordan. Sur les assemblages de lignes. , 1869 .
[14] Shmuel Zaks,et al. Optimal Distributed Algorithms for Sorting and Ranking , 1985, IEEE Transactions on Computers.
[15] Wolfgang J. Paul,et al. Two Nonlinear Lower Bounds for On-Line Computations , 1984, Inf. Control..
[16] Yishay Mansour,et al. Bit Complexity of Order Statistics on a Distributed Star Network , 1989, Inf. Process. Lett..