ALGORITHMS FOR CALCULATION NETWORK SCEDULES SET BY FAMILY OF NODAL SUBSETS
DOI:
https://doi.org/10.18372/2310-5461.6.5210Keywords:
network schedule, subset of nodes, calculation algorithms, oriented graphAbstract
Advantages of the list form of the description of the oriented graph in comparison with the matrix form are proved. Algorithms of calculation of the network schedules set by family of nodal subsets are resulted.
References
Асанов М. О. Дискретная математика: графы, матроиды, алгоритмы / М. О. Асанов, В. А. Баранский, В. В.Расин. — Ижевск : НИЦ «Регулярная и хаотическая динамика», 2001. — 288 с.
Харарри Фрэнк. Теория графов / Фрэнк Харарри; пер. с англ. и предисл. В. П. Козырева; под ред. Г. П. Гаврилова. — Изд. 2-е. — М. : Едиториал, 2003. — 296 с.
Downloads
Published
How to Cite
Issue
Section
License
The scientific journal adheres to the principles of Open Access and provides free, immediate, and permanent access to all published materials without financial, technical, or legal barriers for readers.
All articles are published in Open Access under the Creative Commons Attribution 4.0 International (CC BY 4.0) license.
Copyright
Authors who publish their works in the journal:
-
retain the copyright to their publications;
-
grant the journal the right of first publication of the article;
-
agree to the distribution of their materials under the CC BY 4.0 license;
-
have the right to reuse, archive, and distribute their works (including in institutional and subject repositories), provided that proper reference is made to the original publication in the journal.