A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
A 3/2-approximation algorithm for finding spanning trees with many leaves in cubic graphs ; 2008, 15
Preprint Reihe Mathematik ; 2008, 15
- Klassifikation
-
Mathematik
- Urheber
-
Bonsma, Paul
Zickfeld, Florian
- DOI
-
10.14279/depositonce-14418
- Handle
-
11303/15645
- URN
-
urn:nbn:de:101:1-2021122201440786087277
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:38 MESZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Bonsma, Paul
- Zickfeld, Florian
Ähnliche Objekte (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
The Complexity of Finding Fair Many-to-One Matchings
Infinitely many solutions for cubic nonlinear Schrödinger equations in dimension four
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
The Complexity of Finding Fair Many-to-One Matchings
Infinitely many solutions for cubic nonlinear Schrödinger equations in dimension four
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
The Complexity of Finding Fair Many-to-One Matchings
Infinitely many solutions for cubic nonlinear Schrödinger equations in dimension four
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