Geodesic
A cyclic method for channel routing
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 31 (1991) no. 3, pp. 474-477 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1991_31_3_a16,
     author = {Yu. M. Mikheev},
     title = {A cyclic method for channel routing},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {474--477},
     year = {1991},
     volume = {31},
     number = {3},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1991_31_3_a16/}
}
TY  - JOUR
AU  - Yu. M. Mikheev
TI  - A cyclic method for channel routing
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1991
SP  - 474
EP  - 477
VL  - 31
IS  - 3
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1991_31_3_a16/
LA  - ru
ID  - ZVMMF_1991_31_3_a16
ER  - 
%0 Journal Article
%A Yu. M. Mikheev
%T A cyclic method for channel routing
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1991
%P 474-477
%V 31
%N 3
%U http://geodesic.mathdoc.fr/item/ZVMMF_1991_31_3_a16/
%G ru
%F ZVMMF_1991_31_3_a16
Yu. M. Mikheev. A cyclic method for channel routing. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 31 (1991) no. 3, pp. 474-477. http://geodesic.mathdoc.fr/item/ZVMMF_1991_31_3_a16/

[1] Lazareva T. S., “Algoritm trassirovki pechatnykh soedinenii na osnove predstavleniya o kanalakh”, Avtomatika i vychisl. tekhn., 1969, no. 5, 12–15

[2] Mikheev Yu. M., Otobrazhenie grafov i zadachi postroeniya soedinenii, Preprint No 3, ITM i VT AN SSSR, M., 1980

[3] Mikheev Yu. M., “Postroenie mezhmodulnykh soedinenii v reshetke”, Elektronnaya tekhn. Ser. 3. Mikroelektronika, 1981, no. 4(94), 94–97

[4] Rivest R. L., Baratz A., Miller G., “Provably good channal routing algorithms”, Proc. CMU Conf. on VLSI Systems and Comput., Pittsburg, 1981, 153–159

[5] Baker B. S., “A provably good algorithm for the two module routing problem”, SIAM J. Comput., 15:1 (1986), 162–188 | DOI | Zbl