|
This article is cited in 1 scientific paper (total in 1 paper)
Successive partition of edges of bipartite graph into matchings
A. M. Magomedova, T. A. Magomedovb a Daghestan State University, Makhachkala
b Twitter Inc.
Abstract:
It is assumed that the input data for scheduling a set of customers are given as a bipartite graph in some system of units. We consider the problem of composing a schedule of smallest length under the condition of continuous work with no downtime of each unit and their simultaneous actuation. Conditions are obtained for a partition of the edge set of a graph into matchings to form a schedule of the required form.
Keywords:
graph, schedule, bipartite graph, matching, queuing.
Received: 24.12.2014
Citation:
A. M. Magomedov, T. A. Magomedov, “Successive partition of edges of bipartite graph into matchings”, Diskr. Mat., 28:1 (2016), 78–86; Discrete Math. Appl., 26:6 (2016), 347–353
Linking options:
https://www.mathnet.ru/eng/dm1358https://doi.org/10.4213/dm1358 https://www.mathnet.ru/eng/dm/v28/i1/p78
|
Statistics & downloads: |
Abstract page: | 527 | Full-text PDF : | 300 | References: | 99 | First page: | 81 |
|