Successive partition of edges of bipartite graph into matchings
-
Abdulkarim M. Magomedov
and
Tagir A. Magomedov
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.
Funding
This researchwas carried out with the financial support of 1) the Russian Ministry for Education and Science (Grant no. 2014/33), 2) Dagestan State University (Project no. 3c), 3) Department of Mathematics and Informatics of the Dagestan Scientific Center, Russian Academy of Sciences.
Note: Originally published in Diskretnaya Matematika (2016) 28, №1, 78–86 (in Russian).
References
[1] Swamy M. N. S., Thulasiraman K., Graphs, Networks, and Algorithms, Wiley, 1981, 592 pp.Search in Google Scholar
[2] Vizing V. G., “On the estimate for the chromatic class of p-graph”, Diskretnyy analiz. Sb. nauch. tr., 3, In-t matematiki SO AN SSSR, Novosibirsk, 1964, 25-30 (in Russian).Search in Google Scholar
[3] Holyer I., “The NP-completeness of edge-coloring”, SIAM J. Comput., 10:4 (1981), 718-720.10.1137/0210055Search in Google Scholar
[4] Lovász L., Plummer M.D., Matching theory, North-Holland, 1986, 544 pp.Search in Google Scholar
[5] Asratyan A. S., Kamalyan R. R., “Interval coloring of multigraph edges”, Prikladnaya matematika, 5, Izd-vo Erevanskogo un-ta, Erevan, 1987,25-34 (in Russian).Search in Google Scholar
[6] Magomedov A. M., “The continuous schedule for specialized processors without precedence relation”, Vestnik MEI, ser. Avtomatika, vychisl. tekhnika, informatika, 5 (2009), 14-17 (in Russian).Search in Google Scholar
[7] Magomedov A. M., Sapozhenko A. A., “Conditions for the existence of continuous schedules of duration five”, Moscow Univ. Comp. Math. and Cybernetics, 34:1 (2010), 37-43.10.3103/S0278641910010061Search in Google Scholar
[8] Magomedov A.M., Magomedov T.A., “Application of an algorithm for calculating the maximum density subgraph to the schedule optimization problem”, Math. Notes, 93:2 (2013), 340-342.10.1134/S0001434613010380Search in Google Scholar
[9] Magomedov A.M., “A continuous timetable with m, m - 2, or 2 instructor’s class hours”, Discrete Math. Appl., 22:3 (2012), 261-271.10.1515/dma-2012-018Search in Google Scholar
© 2016 Walter de Gruyter GmbH, Berlin/Boston
Articles in the same Issue
- Conjugacy word problem in the tree product of free groups with a cyclic amalgamation
- Independent sets in graphs
- Successive partition of edges of bipartite graph into matchings
- Limit theorems for the number of successes in random binary sequences with random embeddings
- Bezout rings without non-central idempotents
Articles in the same Issue
- Conjugacy word problem in the tree product of free groups with a cyclic amalgamation
- Independent sets in graphs
- Successive partition of edges of bipartite graph into matchings
- Limit theorems for the number of successes in random binary sequences with random embeddings
- Bezout rings without non-central idempotents
