This article is cited 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.

UDC: 519.628

Bibliographic databases:

•