|
Vestnik Moskovskogo Universiteta. Seriya 1. Matematika. Mekhanika, 2021, Number 1, Pages 55–57
(Mi vmumm4379)
|
|
|
|
Short notes
On the complexity of a linear ordering of weighted directed acyclic graphs
M. I. Shekalev, G. V. Bokov, V. B. Kudryavtsev Lomonosov Moscow State University, Faculty of Mechanics and Mathematics
Abstract:
The paper is focused on weighted directed acyclic graphs with edges weighted with nonnegative integers. The complexity of linear ordering of vertices is considered for these graphs with respect to topological sorting. An accurate estimate of the Shannon function for the complexity of linear ordering of vertices for weighted directed acyclic graphs is obtained.
Key words:
weighted directed acyclic graphs, linear ordering of vertices, topological sorting, complexity, Shannon's function.
Received: 30.10.2019
Citation:
M. I. Shekalev, G. V. Bokov, V. B. Kudryavtsev, “On the complexity of a linear ordering of weighted directed acyclic graphs”, Vestnik Moskov. Univ. Ser. 1. Mat. Mekh., 2021, no. 1, 55–57; Moscow University Mathematics Bulletin, 76:1 (2021), 35–36
Linking options:
https://www.mathnet.ru/eng/vmumm4379 https://www.mathnet.ru/eng/vmumm/y2021/i1/p55
|
Statistics & downloads: |
Abstract page: | 104 | Full-text PDF : | 14 | References: | 32 | First page: | 8 |
|