Skip to main content
SpringerLink
Log in

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

  • Published:
Moscow University Mathematics Bulletin Aims and scope

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.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

REFERENCES

  1. A. V. Aho, M. S. Lam, R. Sethi, and J. D. Ullman, Compilers: Principles, Techniques, and Tools, 2nd ed. (Addison-Wesley, 2007).

    MATH  Google Scholar 

  2. T. H. Cormen, Ch. E. Leiserson, R. L. Rivest, and C. Stein, Introduction to Algorithms, 3rd ed. (MIT Press, Cambridge, MA, 2001).

    MATH  Google Scholar 

  3. E. E. Egorov, ‘‘On the minimal packing of a tree with fixed vertices,’’ Discrete Math. 7, 157–162 (1997).

    MathSciNet  MATH  Google Scholar 

  4. D. Gerbner, B. Keszegh, C. Palmer, and D. Pálvölgyi, ‘‘Topological orderings of weighted directed acyclic graphs,’’ Inform. Process. Lett. 116, 564–568 (2016). https://doi.org/10.1016/j.ipl.2016.04.007

    Article  MathSciNet  MATH  Google Scholar 

  5. R. Sedgewick and K. Wayne, Algorithms, 4th ed. (Addison-Wesley Professional, 2011).

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Chair of Mathematical Theory of Intelligent Systems, Faculty of Mechanics and Mathematics, Lomonosov Moscow State University, 119992, Moscow, Russia

    M. I. Shchekalev, G. V. Bokov & V. B. Kudryavtsev

Authors
  1. M. I. Shchekalev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. G. V. Bokov
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. V. B. Kudryavtsev
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding authors

Correspondence to M. I. Shchekalev, G. V. Bokov or V. B. Kudryavtsev.

Additional information

Translated by I. Tselishcheva

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Shchekalev, M.I., Bokov, G.V. & Kudryavtsev, V.B. On the Complexity of a Linear Ordering of Weighted Directed Acyclic Graphs. Moscow Univ. Math. Bull. 76, 35–36 (2021). https://doi.org/10.3103/S0027132221010071

Download citation

  • Received:

  • Revised:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.3103/S0027132221010071

Keywords:

Search

Navigation