|
Prikladnaya Diskretnaya Matematika, 2015, Number 1(27), Pages 92–95
(Mi pdm493)
|
|
|
|
This article is cited in 1 scientific paper (total in 1 paper)
Applied Graph Theory
Edge-vertex incident matchings in scheduling
A. M. Magomedov, T. A. Magomedov Dagestan State University, Makhachkala, Russia
Abstract:
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.
Citation:
A. M. Magomedov, T. A. Magomedov, “Edge-vertex incident matchings in scheduling”, Prikl. Diskr. Mat., 2015, no. 1(27), 92–95
Linking options:
https://www.mathnet.ru/eng/pdm493 https://www.mathnet.ru/eng/pdm/y2015/i1/p92
|
Statistics & downloads: |
Abstract page: | 181 | Full-text PDF : | 57 | References: | 23 |
|