Geodesic
Edge-vertex incident matchings in scheduling
Prikladnaâ diskretnaâ matematika, no. 1 (2015), pp. 92-95

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

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},
     publisher = {mathdoc},
     number = {1},
     year = {2015},
     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
PB  - mathdoc
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
%I mathdoc
%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/