PUMA
Istituto di Scienza e Tecnologie dell'Informazione     
Codenotti B., Favati P. An algorithm for Manhattan routing in the presence of conflict cycles. Internal note IEI-B4-03, 1986.
 
 
Abstract
(English)
It is shovn an algorithm for channel routing in the Manhattan model, based on the notion of conflict cycles. The routing algorithm leads to an upper bound to the worst case channel width. In some special dense cases, we obtain bounds which are close to the lower bounds proved by Brown and Rivest.
Subject Channel Routing
Conflict Cycles
Manhattan Routing
2-point nets


Icona documento 1) Download Document PDF


Icona documento Open access Icona documento Restricted Icona documento Private

 


Per ulteriori informazioni, contattare: Librarian http://puma.isti.cnr.it

Valid HTML 4.0 Transitional