Please use this identifier to cite or link to this item: http://dx.doi.org/10.14279/depositonce-14414
For citation please use:
Main Title: Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems
Author(s): Bonsma, Paul
Dorn, Frederic
Type: Research Paper
URI: https://depositonce.tu-berlin.de/handle/11303/15641
http://dx.doi.org/10.14279/depositonce-14414
License: http://rightsstatements.org/vocab/InC/1.0/
Abstract: An out-tree T of a directed graph D is a rooted tree subgraph with all arcs directed outwards from the root. An out-branching is a spanning out-tree. By l(D) and ls(D) we denote the maximum number of leaves over all out-trees and out-branchings of D, respectively.
Subject(s): spanning tree
max leaf
directed graph
fixed parameter tractable
Issue Date: 2008
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: 2008, 19
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-019-2008.pdf
Format: Adobe PDF | Size: 215.2 kB
DownloadShow Preview
Thumbnail

Item Export Bar

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