Prikladnaya 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



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






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


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
Full-text PDF (536 kB) Citations (1)
References:
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.
Bibliographic databases:
Document Type: Article
UDC: 519.628
Language: Russian
Citation: A. M. Magomedov, T. A. Magomedov, “Edge-vertex incident matchings in scheduling”, Prikl. Diskr. Mat., 2015, no. 1(27), 92–95
Citation in format AMSBIB
\Bibitem{MagMag15}
\by A.~M.~Magomedov, T.~A.~Magomedov
\paper Edge-vertex incident matchings in scheduling
\jour Prikl. Diskr. Mat.
\yr 2015
\issue 1(27)
\pages 92--95
\mathnet{http://mi.mathnet.ru/pdm493}
Linking options:
  • https://www.mathnet.ru/eng/pdm493
  • https://www.mathnet.ru/eng/pdm/y2015/i1/p92
  • 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:181
    Full-text PDF :57
    References:23
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024