It is shown 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.
An algorithm for Manhattan routing in the presence of conflict cycles
Codenotti B;Favati P
1986
Abstract
It is shown 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.File in questo prodotto:
| File | Dimensione | Formato | |
|---|---|---|---|
|
prod_419876-doc_148586.pdf
accesso aperto
Descrizione: An algorithm for Manhattan routing in the presence of conflict cycles
Dimensione
1.05 MB
Formato
Adobe PDF
|
1.05 MB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
