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

On embedding complete graphs into hypercubes

โœ Scribed by Michael Klugerman; Alexander Russell; Ravi Sundaram

Book ID
108316205
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
273 KB
Volume
186
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Small congestion embedding of graphs int
Small congestion embedding of graphs into hypercubes
โœ Matsubayashi, Akira; Ueno, Shuichi ๐Ÿ“‚ Article ๐Ÿ“… 1999 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 103 KB ๐Ÿ‘ 1 views

We consider the problem of embedding graphs into hypercubes with minimal congestion. Kim and Lai showed that for a given N-vertex graph G and a hypercube it is NP-complete to determine whether G is embeddable in the hypercube with unit congestion, but G can be embedded with unit congestion in a hype