scientific article; zbMATH DE number 2080206
From MaRDI portal
Publication:4472448
zbMath1044.68697MaRDI QIDQ4472448
Michael R. Fellows, Ulrike Stege, Frances A. Rosamond, Catherine McCartin
Publication date: 4 August 2004
Full work available at URL: http://link.springer.de/link/service/series/0558/bibs/1974/19740240.htm
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Analysis of algorithms and problem complexity (68Q25) Combinatorics on words (68R15) Graph theory (including graph drawing) in computer science (68R10)
Related Items (13)
Looking at the stars ⋮ The Impact of Parameterized Complexity to Interdisciplinary Problem Solving ⋮ FPT algorithms and kernels for the directed \(k\)-leaf problem ⋮ The \(k\)-leaf spanning tree problem admits a klam value of 39 ⋮ A new algorithm for finding trees with many leaves ⋮ An exact algorithm for the maximum leaf spanning tree problem ⋮ Tight Bounds and a Fast FPT Algorithm for Directed Max-Leaf Spanning Tree ⋮ Constructing a spanning tree with many leaves ⋮ Sources of complexity in subset choice ⋮ Better Algorithms and Bounds for Directed Maximum Leaf Problems ⋮ Vertex and edge covers with clustering properties: Complexity and algorithms ⋮ Out-branchings with Maximal Number of Leaves or Internal Vertices: Algorithmic Results and Open Problems ⋮ Parameterized Complexity
This page was built for publication: