Geodesic
Reduction of the problem of memory allocation in programming to the problem of coloring the vertices of graphs
Doklady Akademii Nauk, Tome 142 (1962) no. 4, pp. 785-787.

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

@article{DAN_1962_142_4_a10,
     author = {A. P. Ershov},
     title = {Reduction of the problem of memory allocation in programming to the problem of coloring the vertices of graphs},
     journal = {Doklady Akademii Nauk},
     pages = {785--787},
     publisher = {mathdoc},
     volume = {142},
     number = {4},
     year = {1962},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/DAN_1962_142_4_a10/}
}
TY  - JOUR
AU  - A. P. Ershov
TI  - Reduction of the problem of memory allocation in programming to the problem of coloring the vertices of graphs
JO  - Doklady Akademii Nauk
PY  - 1962
SP  - 785
EP  - 787
VL  - 142
IS  - 4
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/item/DAN_1962_142_4_a10/
LA  - ru
ID  - DAN_1962_142_4_a10
ER  - 
%0 Journal Article
%A A. P. Ershov
%T Reduction of the problem of memory allocation in programming to the problem of coloring the vertices of graphs
%J Doklady Akademii Nauk
%D 1962
%P 785-787
%V 142
%N 4
%I mathdoc
%U http://geodesic.mathdoc.fr/item/DAN_1962_142_4_a10/
%G ru
%F DAN_1962_142_4_a10
A. P. Ershov. Reduction of the problem of memory allocation in programming to the problem of coloring the vertices of graphs. Doklady Akademii Nauk, Tome 142 (1962) no. 4, pp. 785-787. http://geodesic.mathdoc.fr/item/DAN_1962_142_4_a10/