Diskretnaya Matematika
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskr. Mat.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnaya Matematika, 2016, Volume 28, Issue 1, Pages 78–86
DOI: https://doi.org/10.4213/dm1358 (Mi dm1358) 		 
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.
Full-text PDF (439 kB) Citations (1)
References:
PDF
HTML
DOI: https://doi.org/10.4213/dm1358
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.
Funding agency Grant number
Ministry of Education and Science of the Russian Federation 2014/33
Даггосуниверситет 3с
This research was 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.
Received: 24.12.2014
English version:
Discrete Mathematics and Applications, 2016, Volume 26, Issue 6, Pages 347–353
DOI: https://doi.org/10.1515/dma-2016-0029
Bibliographic databases:
Document Type: Article
UDC: 519.177.3
Language: Russian
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
Citation in format AMSBIB
\Bibitem{MagMag16}
\by A.~M.~Magomedov, T.~A.~Magomedov
\paper Successive partition of edges of bipartite graph into matchings
\jour Diskr. Mat.
\yr 2016
\vol 28
\issue 1
\pages 78--86
\mathnet{http://mi.mathnet.ru/dm1358}
\crossref{https://doi.org/10.4213/dm1358}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=3527009}
\elib{https://elibrary.ru/item.asp?id=25707499}
\transl
\jour Discrete Math. Appl.
\yr 2016
\vol 26
\issue 6
\pages 347--353
\crossref{https://doi.org/10.1515/dma-2016-0029}
\isi{https://gateway.webofknowledge.com/gateway/Gateway.cgi?GWVersion=2&SrcApp=Publons&SrcAuth=Publons_CEL&DestLinkType=FullRecord&DestApp=WOS_CPL&KeyUT=000390939700003}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-85007543332}
Linking options:
  • https://www.mathnet.ru/eng/dm1358
  • https://doi.org/10.4213/dm1358
  • https://www.mathnet.ru/eng/dm/v28/i1/p78
    • This publication is cited in the following 1 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретная математика
    Statistics & downloads:
    Abstract page:543
    Full-text PDF :315
    References:102
    First page:81
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024