A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs ; 2008, 15
Preprint Reihe Mathematik ; 2008, 15
- Classification
-
Mathematik
- Creator
-
Bonsma, Paul
Zickfeld, Florian
- DOI
-
10.14279/depositonce-14418
- Handle
-
11303/15645
- URN
-
urn:nbn:de:101:1-2021122201440786087277
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
15.08.2025, 7:38 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
- Zickfeld, Florian
Other Objects (12)
Cycle bases of graphs and spanning trees with many leaves : complexity results on planar and regular graphs
Cycle bases of graphs and spanning trees with many leaves - complexity results on planar and regular graphs
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
Stochastic spanning
"We Did Many Projects Together" : Boundary-Spanning Strategies of Councillors in Rural Ghana
Infinitely many solutions for cubic nonlinear Schrödinger equations in dimension four
The Complexity of Finding Fair Many-to-One Matchings
Rooted Spanning Superpixels
Finding the missing many: improving Tuberculosis care in Kajiado county through active case finding and community approaches
Bounded degree spanning trees
Smallest color spanning objects
Chain-constrained spanning trees
Cycle bases of graphs and spanning trees with many leaves : complexity results on planar and regular graphs
Cycle bases of graphs and spanning trees with many leaves - complexity results on planar and regular graphs
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
Stochastic spanning
"We Did Many Projects Together" : Boundary-Spanning Strategies of Councillors in Rural Ghana
Infinitely many solutions for cubic nonlinear Schrödinger equations in dimension four
The Complexity of Finding Fair Many-to-One Matchings
Rooted Spanning Superpixels
Finding the missing many: improving Tuberculosis care in Kajiado county through active case finding and community approaches
Bounded degree spanning trees
Smallest color spanning objects
Chain-constrained spanning trees
Cycle bases of graphs and spanning trees with many leaves : complexity results on planar and regular graphs
Cycle bases of graphs and spanning trees with many leaves - complexity results on planar and regular graphs
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs
Stochastic spanning
"We Did Many Projects Together" : Boundary-Spanning Strategies of Councillors in Rural Ghana
Infinitely many solutions for cubic nonlinear Schrödinger equations in dimension four
The Complexity of Finding Fair Many-to-One Matchings
Rooted Spanning Superpixels
Finding the missing many: improving Tuberculosis care in Kajiado county through active case finding and community approaches
Bounded degree spanning trees
Smallest color spanning objects