Geodesic
Compact graphs and the deterministic algorithm for their synthesis
Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 94-96.

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

Compact structures of computational systems are defined as regular graphs with the minimum diameter. A method for synthesis of compact graphs using the representation of the graph by a set of its vertex-complete projections with the minimally possible number of levels is described. 
@article{PDM_2011_13_a48,
     author = {V. A. Melent'ev},
     title = {Compact graphs and the deterministic algorithm for their synthesis},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {94--96},
     publisher = {mathdoc},
     number = {13},
     year = {2011},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2011_13_a48/}
}
TY  - JOUR
AU  - V. A. Melent'ev
TI  - Compact graphs and the deterministic algorithm for their synthesis
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2011
SP  - 94
EP  - 96
IS  - 13
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/PDM_2011_13_a48/
LA  - ru
ID  - PDM_2011_13_a48
ER  - 
%0 Journal Article
%A V. A. Melent'ev
%T Compact graphs and the deterministic algorithm for their synthesis
%J Prikladnaâ diskretnaâ matematika
%D 2011
%P 94-96
%N 13
%I mathdoc
%U http://geodesic.mathdoc.fr/item/PDM_2011_13_a48/
%G ru
%F PDM_2011_13_a48
V. A. Melent'ev. Compact graphs and the deterministic algorithm for their synthesis. Prikladnaâ diskretnaâ matematika, no. 13 (2011), pp. 94-96. http://geodesic.mathdoc.fr/item/PDM_2011_13_a48/

[1] Melentev V. A., “Formalnye osnovy skobochnykh obrazov v teorii grafov”, Trudy Vtoroi Mezhdunar. konf. “Parallelnye vychisleniya i zadachi upravleniya”, PACO'2004, In-t problem upravleniya RAN im. V. A. Trapeznikova, M., 2004, 694–706

[2] Melentev V. A., “Analiticheskii podkhod k sintezu regulyarnykh grafov s zadannymi znacheniyami poryadka, stepeni i obkhvata”, Prikladnaya diskretnaya matematika, 2010, no. 2(8), 74–86