Branching in digraphs with many and few leaves: Structural and algorithmic results

Jørgen Bang-Jensen, Gregory Gutin*

*Kontaktforfatter for dette arbejde

Publikation: Kapitel i bog/rapport/konference-proceedingKapitel i bogForskningpeer review

Abstrakt

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.

OriginalsprogEngelsk
TitelOptimization Problems in Graph Theory : In Honor of Gregory Z. Gutin's 60th Birthday
RedaktørerBoris Goldengorin
ForlagSpringer
Publikationsdatosep. 2018
Sider93-106
ISBN (Trykt)978-3-319-94829-4
ISBN (Elektronisk)978-3-319-94830-0
DOI
StatusUdgivet - sep. 2018
NavnSpringer Optimization and Its Applications
Vol/bind139
ISSN1931-6828

Fingeraftryk

Dyk ned i forskningsemnerne om 'Branching in digraphs with many and few leaves: Structural and algorithmic results'. Sammen danner de et unikt fingeraftryk.

Citationsformater