Mathematical Foundations of Computer Science 2003

DOI10.1007/b11836zbMath1124.68398OpenAlexW2495578842MaRDI QIDQ5431312

Paul Bonsma, Tobias Brueggemann, Gerhard J. Woeginger

Publication date: 7 December 2007

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b11836

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (13)

FPT algorithms and kernels for the directed \(k\)-leaf problem ⋮ On maximum leaf trees and connections to connected maximum cut problems ⋮ The \(k\)-leaf spanning tree problem admits a klam value of 39 ⋮ On the parameterized complexity of the structure of lineal topologies (depth-first spanning trees) of finite graphs: the number of leaves ⋮ Improved bounds for spanning trees with many leaves ⋮ 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 ⋮ Spanning Trees with Many Leaves in Regular Bipartite Graphs ⋮ A 2-approximation algorithm for finding a spanning tree with maximum number of leaves ⋮ Spanning Trees with Many Leaves in Graphs without Diamonds and Blossoms ⋮ Better Algorithms and Bounds for Directed Maximum Leaf Problems ⋮ On problems without polynomial kernels

This page was built for publication: Mathematical Foundations of Computer Science 2003