Towards a Real-Time Scheduling Framework for Data Transfers in Tree Networks
暂无分享,去创建一个
[1] Nicolae Tapus,et al. Efficient Data Structures for Online QoS-Constrained Data Transfer Scheduling , 2008, 2008 International Symposium on Parallel and Distributed Computing.
[2] Michel Habib,et al. Chordal Graphs and Their Clique Graphs , 1995, WG.
[3] Craig A. Tovey,et al. Solving problems on recursively constructed graphs , 2009, CSUR.
[4] Klaus Jansen,et al. Call scheduling in trees, rings and meshes , 1997, Proceedings of the Thirtieth Hawaii International Conference on System Sciences.
[5] Mohammad R. Salavatipour,et al. On Sum Coloring of Graphs , 2003, Discret. Appl. Math..
[6] Robert E. Tarjan,et al. A Note on Finding Minimum-Cost Edge-Disjoint Spanning Trees , 1985, Math. Oper. Res..
[7] Monika Henzinger,et al. Scheduling multicasts on unit-capacity trees and meshes , 2003, SODA '99.
[8] Martin Charles Golumbic,et al. Representations of Edge Intersection Graphs of Paths in a Tree , 2006 .
[9] Robert E. Tarjan,et al. Fast Algorithms for Finding Nearest Common Ancestors , 1984, SIAM J. Comput..
[10] Geon Cho,et al. A depth‐first dynamic programming procedure for the extended tree knapsack problem in local access network design , 1997, Telecommun. Syst..
[11] Tomio Hirata,et al. Approximation Algorithms for the Weighted Independent Set Problem , 2005, WG.