Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14380
For citation please use:
Main Title: An FPT Algorithm for Directed Spanning k-Leaf
Author(s): Bonsma, Paul
Dorn, Frederic
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15607
http://dx.doi.org/10.14279/depositonce-14380
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: An out-branching of a directed graph is a rooted spanning tree with all arcs directed outwards from the root. We consider the problem of deciding whether a given digraph D has an out-branching with at least k leaves (Directed Spanning k-Leaf). We prove that this problem is fixed parameter tractable, when k is chosen as the parameter. Previously this was only known for restricted classes of directed graphs. The main new ingredient in our approach is a lemma that shows that given a locally optimal out-branching of a directed graph in which every arc is part of at least one out-branching, either an out-branching with at least k leaves exists, or a path decomposition with width O(k3) can be found. This enables a dynamic programming based algorithm of running time 2O(k3logk)·nO(1), where n=|V(D)|
Subject(s): FPT algorithm
maximum leaf
directed graph
spanning tree
out-branching
Issue Date: 2007
Date Available: 17-Dec-2021
Language Code: en
DDC Class: 510 Mathematik
Series: Preprint-Reihe des Instituts für Mathematik, Technische Universität Berlin
Series Number: 2007, 46
ISSN: 2197-8085
TU Affiliation(s): Fak. 2 Mathematik und Naturwissenschaften » Inst. Mathematik
Appears in Collections:Technische Universität Berlin » Publications

Files in This Item:
Report-046-2007.pdf
Format: Adobe PDF | Size: 210.68 kB
DownloadShow Preview
Thumbnail

Item Export Bar

Items in DepositOnce are protected by copyright, with all rights reserved, unless otherwise indicated.