A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem

DOI10.1007/978-3-642-45043-3_27zbMath1417.05086OpenAlexW2256802834MaRDI QIDQ2864311

Frank Kammer

Publication date: 6 December 2013

Published in: Graph-Theoretic Concepts in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-45043-3_27

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

A linear-time kernelization for the rooted \(k\)-leaf outbranching problem

This page was built for publication: A Linear-Time Kernelization for the Rooted k-Leaf Outbranching Problem