Kontakt
Jak nakupovat
Doručení
Nákupní rádce
Relationships among popular interconnection Networks
Angličtina
167 b
Až 30 dní na vrácení zboží
Zákazníci také koupili
/
Brožovaná
732
Kč
/
Brožovaná
258
Kč
/
Brožovaná
754
Kč
Star generated graphs were proposed as an attractive alternative to hypercubes for massive parallel computing in early 1980s, due to sublogarithmic regularity and diameter. However, star graphs suffer from n! vertices. As the gaps between (n-1)! and n! grow too fast to be considered for practical implementation. (n,k)-Arrangement graphs and (n,k)-Star graphs were proposed as a remedy for n! problem. Star graphs are one extreme case in a general class of Cayley graphs generated by transposition trees. This work generalizes Cayley graphs generated by transposition trees to a class that contains both (n,k)-Arrangement graphs and (n,k)-Star graphs as special cases. Moreover connectivity properties, decomposition methods, relationships among different classes of interconnection networks and local orientation rules are derived. Finally, even more general and flexible class of interconnection networks is introduced.
Informace o knize
Angličtina
Kategorie
Darujte tuto knihu ještě dnes
Je to snadné
1 Přidejte knihu do košíku a zvolte doručit jako dárek 2 Obratem vám zašleme poukaz 3 Kniha dorazí na adresu obdarovanéhoMohlo by vás také zajímat
/
Brožovaná
747
Kč
/
Brožovaná
176
Kč
Ahoj! Jsem Libroamiko, tvůj knižní rádce.
Jak ti můžu pomoct?