| | |
| | |
Stat |
Members: 3645 Articles: 2'504'928 Articles rated: 2609
25 April 2024 |
|
| | | |
|
Article overview
| |
|
A Faster Exact Algorithm for the Directed Maximum Leaf Spanning Tree Problem | Daniel Raible
; Henning Fernau
; | Date: |
10 Nov 2009 | Abstract: | Given a directed graph $G=(V,A)$, the Directed Maximum Leaf Spanning Tree
problem asks to compute a directed spanning tree (i.e., an out-branching) with
as many leaves as possible. By designing a Branch-and-Reduced algorithm
combined with the Measure & Conquer technique for running time analysis, we
show that the problem can be solved in time $Oh^*(1.9043^n)$ using polynomial
space. Hitherto, there have been only few examples. Provided exponential space
this run time upper bound can be lowered to $Oh^*(1.8139^n)$. | Source: | arXiv, 0911.1900 | Services: | Forum | Review | PDF | Favorites |
|
|
No review found.
Did you like this article?
Note: answers to reviews or questions about the article must be posted in the forum section.
Authors are not allowed to review their own article. They can use the forum section.
browser Mozilla/5.0 AppleWebKit/537.36 (KHTML, like Gecko; compatible; ClaudeBot/1.0; +claudebot@anthropic.com)
|
| |
|
|
|
| News, job offers and information for researchers and scientists:
| |