Abstract

We consider weighted directed acyclic graphs to whose edges nonnegative integers as weights are assigned. The complexity of a linear ordering of vertices is examined for these graphs in the order of topological sorting. An accurate estimate for the Shannon function of the complexity of the linear ordering problem for weighted directed acyclic graphs is obtained.

中文翻译：

---

关于加权有向无环图的线性排序的复杂性

摘要

我们考虑加权有向无环图，其边缘为非负整数作为权重被分配。按照拓扑排序的顺序检查这些图的顶点线性排序的复杂性。获得了对加权有向无环图的线性排序问题的复杂度的香农函数的准确估计。