IDEAS home Printed from https://ideas.repec.org/h/spr/spochp/978-3-319-94830-0_5.html
   My bibliography  Save this book chapter

Branching in Digraphs with Many and Few Leaves: Structural and Algorithmic Results

In: Optimization Problems in Graph Theory

Author

Listed:
  • Jørgen Bang-Jensen

    (IMADA, University of Southern Denmark)

  • Gregory Gutin

    (University of London)

Abstract

A subgraph T of a digraph D is called an out-tree if T is an oriented tree with just one vertex s of in-degree zero. A spanning out-tree is called an out-branching. A vertex x of an out-branching B is called a leaf if the out-degree of x is zero. This is a survey on out-branchings with minimum and maximum number of leaves covering both structural and algorithmic results.

Suggested Citation

  • Jørgen Bang-Jensen & Gregory Gutin, 2018. "Branching in Digraphs with Many and Few Leaves: Structural and Algorithmic Results," Springer Optimization and Its Applications, in: Boris Goldengorin (ed.), Optimization Problems in Graph Theory, pages 93-106, Springer.
    • Handle: RePEc:spr:spochp:978-3-319-94830-0_5
    DOI: 10.1007/978-3-319-94830-0_5
    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 search for a similarly titled item that would be available.

    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:spochp:978-3-319-94830-0_5. 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.