On the Complexity of a Linear Ordering of Weighted Directed Acyclic Graphs

被引：0

作者：

M. I. Shchekalev

G. V. Bokov

V. B. Kudryavtsev

机构：

[1] Chair of Mathematical Theory of Intelligent Systems,

[2] Faculty of Mechanics and Mathematics,undefined

[3] Lomonosov Moscow State University,undefined

来源：

Moscow University Mathematics Bulletin | 2021年 / 76卷

关键词：

weighted directed acyclic graphs; linear ordering of vertices; topological sorting; complexity; Shannon function;

D O I：

暂无

中图分类号：

学科分类号：

摘要：

引用

页码：35 / 36

页数：1