A cyclic method for channel routing (Q1176940)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 12700
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A cyclic method for channel routing |
scientific article; zbMATH DE number 12700 |
Statements
A cyclic method for channel routing (English)
0 references
25 June 1992
0 references
A construction of design involves routing: the positioning of elements and the construction of links in the installation space according to the given circuit. This paper presents a method for link construction based on the properties of a mapping of multilobed graph formed by regularly situated elements together with their links into a lattice graph that is a special installation space. The construction is carried out via the sequential solutions of combinatorial problems.
0 references
routing
0 references
installation space
0 references
circuit
0 references
link construction
0 references
multilobed graph
0 references
lattice graph
0 references
