IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-3-642-38189-8_8.html
   My bibliography  Save this book chapter

Algorithms for Junctions in Acyclic Digraphs

In: Facets of Combinatorial Optimization

Author

Listed:
  • Carlos Eduardo Ferreira

    (Instituto de Matemática e Estatística)

  • Álvaro Junio Pereira Franco

    (Instituto de Matemática e Estatística)

Abstract

Given targets u and v in a digraph D, we say that a vertex s is a junction of u and v if there are in D internally vertex-disjoint directed paths from s to u and from s to v. In this paper, we show how to characterize junctions in acyclic digraphs. We also consider the following problem and derive an efficient algorithm to solve it. Given an acyclic digraph D, a vertex s in D and k pairs of targets {u 1,v 1},…,{u k ,v k }, determine the pairs of targets {u i ,v i } for which s is a junction. This problem arises in an application brought to our attention by an anthropologist. In this application the digraph represents the genealogy of an ethnic group in Brazilian Amazon region, and the pairs of targets are individuals that are married. We apply our algorithm to find all the junctions of k pairs of targets on those kinship networks. Experiments have shown that our algorithm had a good performance for the inputs considered. Some results are described in this paper.

Suggested Citation

  • Carlos Eduardo Ferreira & Álvaro Junio Pereira Franco, 2013. "Algorithms for Junctions in Acyclic Digraphs," Springer Books, in: Michael Jünger & Gerhard Reinelt (ed.), Facets of Combinatorial Optimization, edition 127, pages 175-194, Springer.
    • Handle: RePEc:spr:sprchp:978-3-642-38189-8_8
    DOI: 10.1007/978-3-642-38189-8_8
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    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:spr:sprchp:978-3-642-38189-8_8. 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.

    We have no bibliographic references for this item. You can help adding them by using 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.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.