zweidimensionales bewegtes Bild
Proof of the tree packing conjecture for bounded degree trees
- Standort
-
Hannover TIB
- Umfang
-
140MB, 00:43:03:14 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
Geometric and Structural Graph Theory (17w5154) ; (Jan. 2017)
- Schlagwort
-
Discrete mathematics
Combinatorics
Mathematics
Computer science
- Ereignis
-
Veröffentlichung
- (wer)
-
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
- (wann)
-
2017-01-01
- Beteiligte Personen und Organisationen
-
Kuhn, Daniela
Joos, Felix
Kim, Jaehoon
Osthus, Deryk
Tyomkyn, Mykhaylo
- DOI
-
10.14288/1.0365325
- Letzte Aktualisierung
-
04.12.2024, 08:09 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Kuhn, Daniela
- Joos, Felix
- Kim, Jaehoon
- Osthus, Deryk
- Tyomkyn, Mykhaylo
- Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Entstanden
- 2017-01-01
Ähnliche Objekte (12)
Bounded degree spanning trees
Non-Preemptive Tree Packing
Universality for bounded degree spanning trees in randomly perturbed graphs
Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights
Acylindrical actions on trees and the Farrell-Jones Conjecture
On the tree conjecture for the network creation game
Canonizing Graphs of Bounded Tree Width in Logspace
An Improved Isomorphism Test for Bounded-Tree-Width Graphs
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
On the decision complexity of the bounded theories of trees
Polynomially Bounded Algorithms for Locating p-Centres on a Tree
On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B
Bounded degree spanning trees
Non-Preemptive Tree Packing
Universality for bounded degree spanning trees in randomly perturbed graphs
Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights
Acylindrical actions on trees and the Farrell-Jones Conjecture
On the tree conjecture for the network creation game
Canonizing Graphs of Bounded Tree Width in Logspace
An Improved Isomorphism Test for Bounded-Tree-Width Graphs
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
On the decision complexity of the bounded theories of trees
Polynomially Bounded Algorithms for Locating p-Centres on a Tree
On Packing Low-Diameter Spanning Trees: Q/A Session C - Paper C1.B
Bounded degree spanning trees
Non-Preemptive Tree Packing
Universality for bounded degree spanning trees in randomly perturbed graphs
Fine asymptotics for the maximum degree in weighted recursive trees with bounded random weights
Acylindrical actions on trees and the Farrell-Jones Conjecture
On the tree conjecture for the network creation game
Canonizing Graphs of Bounded Tree Width in Logspace
An Improved Isomorphism Test for Bounded-Tree-Width Graphs
Efficient algorithms for disjoint Steiner trees packing problems in planar graphs
On the decision complexity of the bounded theories of trees
Polynomially Bounded Algorithms for Locating p-Centres on a Tree