Algoritmic problems of mathematical theory of coding and theory og graphs.
Main publications:
Markov Al. A., Smirnova T. G., “Algorithmic bases of generalized prefix coding”, Soviet Math. Dokl., 274:4 (1984), 790–793 (in Russian)
Smirnova T. G., “On chromatic dimension of graphs”, Diskretnaya Matematica, 1:3 (1989), 139–140 (in Russian)
Markov Al. A., Smirnova T. G., “On word colourings and some perfect graphs”, Diskretnaya Matematica, 2:2 (1990), 16–32 (in Russian) ; English transl., Discrete Math. Appl., 2:1 (1992), 25–44
A. A. Markov, T. G. Smirnova, “On dictionary colorings and some perfect graphs”, Diskr. Mat., 2:2 (1990), 16–32; Discrete Math. Appl., 2:1 (1992), 25–44
1989
2.
T. G. Smirnova, “The chromatic dimension of a graph”, Diskr. Mat., 1:3 (1989), 139–140
1984
3.
Al. A. Markov, T. G. Smirnova, “Algorithmic foundations of generalized-prefix encodings”, Dokl. Akad. Nauk SSSR, 274:4 (1984), 790–793
Contact us: