Embedding interconnection networks in grids via the layered cross product

Guy Even, Shimon Even

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A technique for automatically producing a rectilinear planar drawings of interconnection networks is described. It is based on the Layered Cross Product suggested by Even and Litman. The technique is demonstrated on the Butterfly network, the binary tree and the Meshof-Trees of Leighton.

Original languageEnglish
Title of host publicationAlgorithms and Complexity - 3rd Italian Conference, CIAC 1997, Proceedings
EditorsGiancarlo Bongiovanni, Daniel Pierre Bovet, Giuseppe Di Battista
PublisherSpringer Verlag
Pages3-12
Number of pages10
ISBN (Print)3540625925, 9783540625926
DOIs
StatePublished - 1997
Externally publishedYes
Event3rd Italian Conference on Algorithms and Complexity, CIAC 1997 - Rome, Italy
Duration: 12 Mar 199714 Mar 1997

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume1203
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference3rd Italian Conference on Algorithms and Complexity, CIAC 1997
Country/TerritoryItaly
CityRome
Period12/03/9714/03/97

Fingerprint

Dive into the research topics of 'Embedding interconnection networks in grids via the layered cross product'. Together they form a unique fingerprint.

Cite this