๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

A General Lower Bound for Potentially H -Graphic Sequences

โœ Scribed by Ferrara, Michael J.; Schmitt, John

Book ID
118197024
Publisher
Society for Industrial and Applied Mathematics
Year
2009
Tongue
English
Weight
191 KB
Volume
23
Category
Article
ISSN
0895-4801

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

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