Geodesic
Methods of finding all minimum coverings of a graph by cliques
Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 34 (1994) no. 8, pp. 1272-1292 Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

@article{ZVMMF_1994_34_8_a10,
     author = {E. V. Bratceva and V. P. Cherenin},
     title = {Methods of finding all minimum coverings of a graph by cliques},
     journal = {\v{Z}urnal vy\v{c}islitelʹnoj matematiki i matemati\v{c}eskoj fiziki},
     pages = {1272--1292},
     year = {1994},
     volume = {34},
     number = {8},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_8_a10/}
}
TY  - JOUR
AU  - E. V. Bratceva
AU  - V. P. Cherenin
TI  - Methods of finding all minimum coverings of a graph by cliques
JO  - Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
PY  - 1994
SP  - 1272
EP  - 1292
VL  - 34
IS  - 8
UR  - http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_8_a10/
LA  - ru
ID  - ZVMMF_1994_34_8_a10
ER  - 
%0 Journal Article
%A E. V. Bratceva
%A V. P. Cherenin
%T Methods of finding all minimum coverings of a graph by cliques
%J Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki
%D 1994
%P 1272-1292
%V 34
%N 8
%U http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_8_a10/
%G ru
%F ZVMMF_1994_34_8_a10
E. V. Bratceva; V. P. Cherenin. Methods of finding all minimum coverings of a graph by cliques. Žurnal vyčislitelʹnoj matematiki i matematičeskoj fiziki, Tome 34 (1994) no. 8, pp. 1272-1292. http://geodesic.mathdoc.fr/item/ZVMMF_1994_34_8_a10/

[1] Kharari F., Teoriya grafov, Mir, M., 1973 | MR

[2] Auguston J., Minker J., “An analysis of some graph theoretical cluster techniques”, J. Assoc. Comput. Machinery, 17:4 (1970), 571–588

[3] Reingold E., Nivergelt Yu., Deo H., Kombinatornye algoritmy. Teoriya i praktika, Mir, M., 1980 | MR | Zbl

[4] Tsukiyama S., Ide M., Ariyoshi H., Shirakawa I., “A new algorithm for generating all the maximal independent sets”, SIAM J. Comput., 6:3 (1977), 507–517 | DOI | MR

[5] Komarov M. M., Postroenie klik grafa metodom dekompozitsii, Preprint, IPMatem. AN SSSR, M., 1982

[6] Maghout K., “Applications de l'algèbre de Boole à la théorie des graphes”, Cahiers du Centre d'Etudes Rech. Operat. Bruxelles 5, 21:1–2 (1963) | MR | Zbl

[7] Zykov A. A., Teoriya konechnykh grafov, v. I, Nauka, Novosibirsk, 1969

[8] Kristofides N., Teoriya grafov. Algoritmicheskii podkhod, Mir, M., 1978 | MR

[9] Cherenin V. P., “Reshenie nekotorykh kombinatornykh zadach optimalnogo planirovaniya metodom posledovatelnykh raschetov”, Nauchno-metodich. materialy ekonomiko-matem. seminara Laboratorii ekonomiko-matem. metodov AN SSSR, Vyp. 2, M., 1962

[10] Ryzhkov A. P., “Razbienie grafa na minimalnoe chislo polnykh podgrafov”, Kibernetika, 1975, no. 6, 90–95

[11] Petrov A., Cherenin V., “Usovershenstvovanie metoda sostavleniya plana formirovaniya poezdov”, Zh.-d. transp., 1948, no. 3, 60–71

[12] Cherenin V. P., “Mekhanizatsiya raschetov po sostavleniyu plana formirovaniya poezdov”, Tekhn. zheleznykh dorog, 1954, no. 1, 22–24

[13] Cherenin V. P., “Sostavlenie optimalnogo plana formirovaniya odnogruppnykh poezdov na elektronnykh vychislitelnykh mashinakh”, Vestn. VNII zh.-d. transp., 1, M., 1961

[14] Christofides N., “An algorithm for the chromatic number of a graph”, Comput. J., 14:1 (1971), 38–39 | DOI | MR | Zbl

[15] Wang Chung C., “An algorithm for the chromatic number of graph”, Journal ACM, 21:3 (1974), 385–391 | DOI | MR | Zbl

[16] Brattseva E. V., Cherenin V. P., Algoritmy agregirovaniya, Preprint, VTs AN SSSR, M., 1990 | MR

[17] Rodionov V. V., “Parametricheskaya zadacha o kratchaishikh rasstoyaniyakh”, Zh. vychisl. matem. i matem. fiz., 8:5 (1968), 1173–1177 | MR

[18] Brattseva E. V., “O vosstanavlivaemosti osnovnykh invariantov grafa”, Diskretnaya matem., 5:4 (1993), 109–119 | MR | Zbl

[19] Papadimitriu X., Staiglits K., Kombinatornaya optimizatsiya. Algoritmy i slozhnost, Mir, M., 1985 | MR

[20] Kofman A., Vvedenie v prikladnuyu kombinatoriku, Nauka, M., 1975 | MR