Geodesic
Edge-vertex incident matchings in scheduling
Prikladnaâ diskretnaâ matematika, no. 1 (2015), pp. 92-95
Cet article a éte moissonné depuis la source Math-Net.Ru

Voir la notice de l'article

The optimization problem for schedules represented by means of graphs with maximal vertex degree 3 is solved by using the edge-vertex incident matchings.
Keywords: graph matching, scheduling, optimization. 
@article{PDM_2015_1_a9,
     author = {A. M. Magomedov and T. A. Magomedov},
     title = {Edge-vertex incident matchings in scheduling},
     journal = {Prikladna\^a diskretna\^a matematika},
     pages = {92--95},
     year = {2015},
     number = {1},
     language = {ru},
     url = {http://geodesic.mathdoc.fr/item/PDM_2015_1_a9/}
}
TY  - JOUR
AU  - A. M. Magomedov
AU  - T. A. Magomedov
TI  - Edge-vertex incident matchings in scheduling
JO  - Prikladnaâ diskretnaâ matematika
PY  - 2015
SP  - 92
EP  - 95
IS  - 1
UR  - http://geodesic.mathdoc.fr/item/PDM_2015_1_a9/
LA  - ru
ID  - PDM_2015_1_a9
ER  - 
%0 Journal Article
%A A. M. Magomedov
%A T. A. Magomedov
%T Edge-vertex incident matchings in scheduling
%J Prikladnaâ diskretnaâ matematika
%D 2015
%P 92-95
%N 1
%U http://geodesic.mathdoc.fr/item/PDM_2015_1_a9/
%G ru
%F PDM_2015_1_a9
A. M. Magomedov; T. A. Magomedov. Edge-vertex incident matchings in scheduling. Prikladnaâ diskretnaâ matematika, no. 1 (2015), pp. 92-95. http://geodesic.mathdoc.fr/item/PDM_2015_1_a9/

[1] Ore O., Teorija grafov, Nauka Publ., Moscow, 1980 (in Russian) | MR

[2] Geri M., Johnson D., Vychislitel'nye mashiny i trudnoreshaemye zadachi, Mir Publ., Moscow, 1982 (in Russian) | MR

[3] Magomedov A. M., Magomedov T. A., “Interval'naja na odnoj dole pravil'naja rjobernaja 5-raskraska dvudol'nogo grafa”, Prikladnaya Diskretnaya Matematika, 2011, no. 3, 85–91 (in Russian)

[4] Magomedov A. M., Sapozhenko A. A., “Uslovija sushhestvovanija nepreryvnyh raspisanij dlitel'nosti pjat'”, Vestnik MSU. Ser. Vychislitel'naya Matematika i Kibernetika, 2010, no. 1, 39–44 (in Russian) | MR | Zbl

[5] Magomedov A. M., Magomedov T. A., “O prilozhenii algoritma vychislenija podgrafa maksimal'noj plotnosti k zadache optimizacii raspisanija”, Matem. zametki, 93:2 (2013), 313–315 (in Russian) | DOI | MR | Zbl