- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Random structures & algorithms(55, 2019), H. 4, S.854-864
- Ereignis
-
Veröffentlichung
- (wo)
-
Ilmenau
- (wer)
-
TU Ilmenau
- (wann)
-
2019
- Urheber
- DOI
-
10.1002/rsa.20850
- URN
-
urn:nbn:de:101:1-2020060813354473682307
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:43 MEZ
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
- Böttcher, Julia
- Han, Jie
- Kohayakawa, Yoshiharu
- Montgomery, Richard
- Parczyk, Olaf
- Person, Yury
- TU Ilmenau
Entstanden
- 2019
Ähnliche Objekte (12)
Embedding spanning bounded degree graphs in randomly perturbed graphs
Bounded degree spanning trees
Identifying preferences in networks with bounded degree
Identifying preferences in networks with bounded degree
Preservation and decomposition theorems for bounded degree structures
Complexity of Normal Forms on Structures of Bounded Degree
On Approximability of Bounded Degree Instances of Selected Optimization Problems
On approximability of bounded degree instances of selected optimization problems
Proof of the tree packing conjecture for bounded degree trees
Universality
Stochastic spanning
The Boundary A-(T)-menability of the Space of Finite Bounded Degree Graphs
Embedding spanning bounded degree graphs in randomly perturbed graphs
Bounded degree spanning trees
Identifying preferences in networks with bounded degree
Identifying preferences in networks with bounded degree
Preservation and decomposition theorems for bounded degree structures
Complexity of Normal Forms on Structures of Bounded Degree
On Approximability of Bounded Degree Instances of Selected Optimization Problems
On approximability of bounded degree instances of selected optimization problems
Proof of the tree packing conjecture for bounded degree trees
Universality
Stochastic spanning
The Boundary A-(T)-menability of the Space of Finite Bounded Degree Graphs
Embedding spanning bounded degree graphs in randomly perturbed graphs
Bounded degree spanning trees
Identifying preferences in networks with bounded degree
Identifying preferences in networks with bounded degree
Preservation and decomposition theorems for bounded degree structures
Complexity of Normal Forms on Structures of Bounded Degree
On Approximability of Bounded Degree Instances of Selected Optimization Problems
On approximability of bounded degree instances of selected optimization problems
Proof of the tree packing conjecture for bounded degree trees
Universality
Stochastic spanning