- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
An FPT Algorithm for Directed Spanning k-Leaf ; 2007, 46
Preprint Reihe Mathematik ; 2007, 46
- Classification
-
Mathematik
- Creator
-
Bonsma, Paul
Dorn, Frederic
- DOI
-
10.14279/depositonce-14380
- Handle
-
11303/15607
- URN
-
urn:nbn:de:101:1-2021122202135569154543
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:24 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Bonsma, Paul
- Dorn, Frederic
Other Objects (12)
Simulated annealing algorithm for the robust spanning tree problem
Engineering an external memory minimum spanning tree algorithm
DC-RST: a parallel algorithm for random spanning trees in network analytics
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems
Stochastic spanning
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
Rooted Spanning Superpixels
A spanning tree construction algorithm for industrial wireless sensor networks based on quantum artificial bee colony
A novel genetic algorithm based on all spanning trees of undirected graph for distribution network reconfiguration
Using Positive Spanning Sets to Achieve d-Stationarity with the Boosted DC Algorithm
A Pruning Algorithm for Reverse Nearest Neighbors in Directed Road Networks
Bounded degree spanning trees
Simulated annealing algorithm for the robust spanning tree problem
Engineering an external memory minimum spanning tree algorithm
DC-RST: a parallel algorithm for random spanning trees in network analytics
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems
Stochastic spanning
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
Rooted Spanning Superpixels
A spanning tree construction algorithm for industrial wireless sensor networks based on quantum artificial bee colony
A novel genetic algorithm based on all spanning trees of undirected graph for distribution network reconfiguration
Using Positive Spanning Sets to Achieve d-Stationarity with the Boosted DC Algorithm
A Pruning Algorithm for Reverse Nearest Neighbors in Directed Road Networks
Bounded degree spanning trees
Simulated annealing algorithm for the robust spanning tree problem
Engineering an external memory minimum spanning tree algorithm
DC-RST: a parallel algorithm for random spanning trees in network analytics
Tight Bounds and Faster Algorithms for Directed Max-Leaf Problems
Stochastic spanning
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
Rooted Spanning Superpixels
A spanning tree construction algorithm for industrial wireless sensor networks based on quantum artificial bee colony
A novel genetic algorithm based on all spanning trees of undirected graph for distribution network reconfiguration
Using Positive Spanning Sets to Achieve d-Stationarity with the Boosted DC Algorithm
A Pruning Algorithm for Reverse Nearest Neighbors in Directed Road Networks