A cyclic method for channel routing (Q1176940): Difference between revisions
From MaRDI portal
Removed claim: reviewed by (P1447): Item:Q199348 |
Set profile property. |
||
| (One intermediate revision by one other user not shown) | |||
| Property / reviewed by | |||
| Property / reviewed by: Zhenhong Liu / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Latest revision as of 23:31, 4 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A cyclic method for channel routing |
scientific article |
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
