Citation: Kq. Li et al., LOWER BOUNDS FOR DYNAMIC TREE EMBEDDING IN BIPARTITE NETWORKS, Journal of parallel and distributed computing (Print), 53(2), 1998, pp. 119-143
Citation: H. Shen et al., PERFORMANCE ANALYSIS FOR DYNAMIC TREE EMBEDDING IN K-PARTITE NETWORKSBY A RANDOM-WALK, Journal of parallel and distributed computing, 50(1-2), 1998, pp. 144-156
Citation: Jyt. Leung et al., ROUTING MESSAGES WITH RELEASE TIME AND DEADLINE CONSTRAINTS, Journal of parallel and distributed computing, 31(1), 1995, pp. 65-76