Better Algorithms and Bounds for Directed Maximum Leaf Problems
From MaRDI portal
Publication:5458844
DOI10.1007/978-3-540-77050-3_26zbMath1135.90416MaRDI QIDQ5458844
Gregory Gutin, Noga Alon, Michael Krivelevich, Fedor V. Fomin, Saket Saurabh
Publication date: 24 April 2008
Published in: FSTTCS 2007: Foundations of Software Technology and Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-77050-3_26
90C35: Programming involving graphs or networks
68Q25: Analysis of algorithms and problem complexity
05C85: Graph algorithms (graph-theoretic aspects)