Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem

From MaRDI portal
Publication:3569757
Jump to:navigation, search

DOI10.1007/978-3-642-13182-0_31zbMath1284.05267OpenAlexW1673084046MaRDI QIDQ3569757

Henning Fernau, Daniel Binkele-Raible

Publication date: 22 June 2010

Published in: Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-13182-0_31



Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85)


Related Items (1)

An exact exponential-time algorithm for the directed maximum leaf spanning tree problem







This page was built for publication: A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:3569757&oldid=16963787"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 5 February 2024, at 02:10.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki