A new algorithm for finding trees with many leaves
type: Item
instance of: scholarly article
title: A new algorithm for finding trees with many leaves
zbMATH Open document ID: 1230.68112
author: Joachim Kneis
author: Alexander Langer
author: Peter Rossmanith
published in: Algorithmica
publication date: 2011-12-14T00:00:00Z
full work available at URL: http://publications.rwth-aachen.de/record/47970
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 05C85
zbMATH DE Number: 5988474
zbMATH Keywords: graph algorithms
zbMATH Keywords: out-trees
zbMATH Keywords: out-branchings
zbMATH Keywords: directed maximum-leaf out-tree
zbMATH Keywords: directed maximum-leaf out-branching
MaRDI profile type: Publication
OpenAlex ID: W2087477484
cites work: Better Algorithms and Bounds for Directed Maximum Leaf Problems
cites work: Parameterized Algorithms for Directed Maximum Leaf Problems
cites work: Spanning Directed Trees with Many Leaves
cites work: Digraphs
cites work: On Linear Time Minor Tests with Depth-First Search
cites work: Spanning Trees with Many Leaves in Graphs With Minimum Degree Three
cites work: Tight bounds and a fast FPT algorithm for directed Max-Leaf Spanning Tree
cites work: Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree
cites work: A 3/2-Approximation Algorithm for Finding Spanning Trees with Many Leaves in Cubic Graphs
cites work: Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms
cites work: Mathematical Foundations of Computer Science 2003
cites work: On Finding Directed Trees with Many Leaves
cites work: FPT algorithms and kernels for the directed \(k\)-leaf problem
cites work: Q4850549
cites work: An approximation algorithm for the maximum leaf spanning arborescence problem
cites work: On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
cites work: Q4472448
cites work: Kernel(s) for Problems with No Kernel: On Out-Trees with Many Leaves
cites work: Solving connected dominating set faster than \(2^n\)
cites work: A short note on the approximability of the maximum leaves spanning tree problem
cites work: Q4198056
cites work: Minimum Leaf Out-Branching Problems
cites work: Which problems have strongly exponential complexity?
cites work: Spanning Trees with Many Leaves
cites work: Limits and Applications of Group Algebras for Parameterized Problems
cites work: Q5710169
cites work: Graph minors. XIII: The disjoint paths problem
cites work: Q4252040
DOI: 10.1007/S00453-010-9454-5
description: scientific article; zbMATH DE number 5988474