IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v10y2021i1p45-d709882.html
   My bibliography  Save this article

New Applied Problems in the Theory of Acyclic Digraphs

Author

Listed:
  • Gurami Tsitsiashvili

    (Institute for Applied Mathematics, Far Eastern Branch of Russian Academy of Sciences, 690041 Vladivostok, Russia)

  • Victor Bulgakov

    (Federal Scientific Center of the East Asia Biodiversity, Far Eastern Branch of Russian Academy of Sciences, 690022 Vladivostok, Russia)

Abstract

The following two optimization problems on acyclic digraph analysis are solved. The first of them consists of determining the minimum (in terms of volume) set of arcs, the removal of which from an acyclic digraph breaks all paths passing through a subset of its vertices. The second problem is to determine the smallest set of arcs, the introduction of which into an acyclic digraph turns it into a strongly connected one. The first problem was solved by reduction to the problem of the maximum flow and the minimum section. The second challenge was solved by calculating the minimum number of input arcs and determining the smallest set of input arcs in terms of the minimum arc coverage of an acyclic digraph. The solution of these problems extends to an arbitrary digraph by isolating the components of cyclic equivalence in it and the arcs between them.

Suggested Citation

  • Gurami Tsitsiashvili & Victor Bulgakov, 2021. "New Applied Problems in the Theory of Acyclic Digraphs," Mathematics, MDPI, vol. 10(1), pages 1-10, December.
    • Handle: RePEc:gam:jmathe:v:10:y:2021:i:1:p:45-:d:709882
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/10/1/45/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/10/1/45/
    Download Restriction: no
    ---><---

    References listed on IDEAS

    as
    1. Paul Sheridan & Takeshi Kamimura & Hidetoshi Shimodaira, 2010. "A Scale-Free Structure Prior for Graphical Models with Applications in Functional Genomics," PLOS ONE, Public Library of Science, vol. 5(11), pages 1-12, November.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Sheridan, Paul & Yagahara, Yuichi & Shimodaira, Hidetoshi, 2012. "Measuring preferential attachment in growing networks with missing-timelines using Markov chain Monte Carlo," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 391(20), pages 5031-5040.
    2. Almudevar, Anthony & LaCombe, Jason, 2012. "On the choice of prior density for the Bayesian analysis of pedigree structure," Theoretical Population Biology, Elsevier, vol. 81(2), pages 131-143.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:10:y:2021:i:1:p:45-:d:709882. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    If CitEc recognized a bibliographic reference but did not link an item in RePEc to it, you can help with this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.