✦ LIBER ✦

Lower Bounds for Dynamic Tree Embedding in Bipartite Networks

✍ Scribed by Keqin Li; Yi Pan; Hong Shen; Gilbert H. Young; Si Qing Zheng

Publisher: Elsevier Science
Year: 1998
Tongue: English
Weight: 332 KB
Volume: 53
Category: Article
ISSN: 0743-7315
DOI: 10.1006/jpdc.1998.1475

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Lower bounds for rectilinear Steiner tre

Lower bounds for rectilinear Steiner trees in bounded space

✍ Timothy Law Snyder 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 438 KB

Performance Analysis for Dynamic Tree Em

Performance Analysis for Dynamic Tree Embedding ink-Partite Networks by a Random Walk

✍ Hong Shen; K. Li; Y. Pan; G.H. Young; S.Q. Zheng 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 166 KB

A lower bound for interval routing in ge

A lower bound for interval routing in general networks

✍ Tse, Savio S. H.; Lau, Francis C. M. 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 109 KB 👁 2 views

Interval routing is a space-efficient routing method for point-to-point communication networks. The method has drawn considerable attention in recent years because of its being incorporated into the design of a commercially available routing chip. The method is based on proper labeling of edges of t

Lower bound for connectivity in local-le

Lower bound for connectivity in local-learning neural networks

✍ Yaser S Abu-Mostafa 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 457 KB

Performance evaluation of a random-walk-

Performance evaluation of a random-walk-based algorithm for embedding dynamically evolving trees in hypercubic networks

✍ Keqin Li 📂 Article 📅 2004 🏛 John Wiley and Sons 🌐 English ⚖ 250 KB 👁 1 views

A lower bound for the steiner tree probl

A lower bound for the steiner tree problem in directed graphs

✍ Weiguo Liu 📂 Article 📅 1990 🏛 John Wiley and Sons 🌐 English ⚖ 593 KB