Geodesic
By-passes with ordered enclosing in planar graphs
Diskretnyj analiz i issledovanie operacij, Tome 13 (2006) no. 2, pp. 31-43.

Voir la notice de l'article provenant de la source Math-Net.Ru

@article{DA_2006_13_2_a2,
     author = {T. A. Panyukova},
     title = {By-passes with ordered enclosing in planar graphs},
     journal = {Diskretnyj analiz i issledovanie operacij},
     pages = {31--43},
     publisher = {mathdoc},
     volume = {13},
     number = {2},
     year = {2006},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DA_2006_13_2_a2/}
}
TY  - JOUR
AU  - T. A. Panyukova
TI  - By-passes with ordered enclosing in planar graphs
JO  - Diskretnyj analiz i issledovanie operacij
PY  - 2006
SP  - 31
EP  - 43
VL  - 13
IS  - 2
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DA_2006_13_2_a2/
LA  - ru
ID  - DA_2006_13_2_a2
ER  - 
%0 Journal Article
%A T. A. Panyukova
%T By-passes with ordered enclosing in planar graphs
%J Diskretnyj analiz i issledovanie operacij
%D 2006
%P 31-43
%V 13
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DA_2006_13_2_a2/
%G ru
%F DA_2006_13_2_a2
T. A. Panyukova. By-passes with ordered enclosing in planar graphs. Diskretnyj analiz i issledovanie operacij, Tome 13 (2006) no. 2, pp. 31-43. http://geodesic.mathdoc.fr/item/DA_2006_13_2_a2/

[1] Zykov A. A., Osnovy teorii grafov, Vuzovskaya kniga, M., 2004

[2] Panyukov A. V., Panyukova T. A., “Eilerovy tsikly s uporyadochennym okhvatyvaniem”, Problemy teoreticheskoi kibernetiki, Tezisy dokladov XII Mezhdunarodnoi konferentsii. Chast II (Nizhnii Novgorod, 17–22 maya 1999 g.), Izd-vo mekhaniko-matematicheskogo fakulteta MGU, M., 1999, 148

[3] Panyukova T. A., “Algoritm postroeniya eilerovykh tsiklov spetsialnogo vida”, Problemy teoreticheskoi kibernetiki, Tezisy dokladov XIII Mezhdunarodnoi konferentsii. Chast II (Kazan, 27–31 maya 2002 g.), Izd-vo mekhaniko-matematicheskogo fakulteta MGU, M., 2002, 142

[4] Panyukova T. A., “Postroenie eilerovykh tsiklov spetsialnogo vida v planarnom grafe”, Materialy VII Mezhdunarodnogo seminara «Diskretnaya matematika i ee prilozheniya», ch. II, Izd-vo tsentra prikladnykh issledovanii pri mekhaniko-matematicheskom fakultete MGU, M., 2001, 149

[5] Panyukova T. A., “Postroenie marshrutov s uporyadochennym okhvatyvaniem v ploskikh grafakh”, Trudy 36-i Regionalnoi molodezhnoi konferentsii «Problemy teoreticheskoi i prikladnoi matematiki», UrO RAN, Ekaterinburg, 2005, 61–66

[6] Panyukov A. V., Panioukova T. A., “The algorithm for tracing of flat Euler cycles with ordered enclosing”, Proceedings of Chelyabinsk Scientific Center, 2000, no. 4(9), 18–22 ; http://csc.ac.ru/news/2000_4/2000_4_1_4.zip | MR

[7] Panioukova T. A., Panyukov A. V., “Algorithms for construction of ordered enclosing traces in planar Eulerian graphs”, The International Workshop on Computer Science and Information Technologies' 2003, Proc. Vol. 1 (Ufa, September 16–18, 2003), Ufa State Technical University, Ufa, 2003, 134–138