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

A resizing algorithm for LSI layout with diagonal edges

โœ Scribed by Akira Nagao; Takashi Kambe


Publisher
John Wiley and Sons
Year
2001
Tongue
English
Weight
748 KB
Volume
84
Category
Article
ISSN
1042-0967

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


An algorithm for construction of a k-con
โœ Ulrich Schumacher ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 470 KB

Two fundamental considerations in the design of a communication network are reliability and maximum transmission delay. In this paper we give an algorithm for construction of an undirected graph with n vertices in which there are k node-disjoint paths between any two nodes. The generated graphs will