- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Logical Methods in Computer Science, 11.2015, issue 4, paper 17, S. 1–44, DOI: 10.2168/LMCS-11(4:17)2015
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Frankfurt am Main
- (wer)
-
Universitätsbibliothek Johann Christian Senckenberg
- (wann)
-
2015
- Urheber
-
Harwath, Frederik
Heimberg, Lucas
Schweikardt, Nicole
- URN
-
urn:nbn:de:hebis:30:3-306349
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:57 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
- Harwath, Frederik
- Heimberg, Lucas
- Schweikardt, Nicole
- Universitätsbibliothek Johann Christian Senckenberg
Entstanden
- 2015
Ähnliche Objekte (12)
Bounded degree spanning trees
Decomposition theorems
L(Q)-preservation theorems
Identifying preferences in networks with bounded degree
Identifying preferences in networks with bounded degree
Complexity of Normal Forms on Structures of Bounded Degree
Embedding spanning bounded degree graphs in randomly perturbed graphs
Preservation theorems for finite support iterations I.
Preservation theorems for finite support iterations II.
Absolute sets and the Decomposition Theorem
On Gallai's decomposition theorem for graphs
The decomposition theorem: the smooth case
Bounded degree spanning trees
Decomposition theorems
L(Q)-preservation theorems
Identifying preferences in networks with bounded degree
Identifying preferences in networks with bounded degree
Complexity of Normal Forms on Structures of Bounded Degree
Embedding spanning bounded degree graphs in randomly perturbed graphs
Preservation theorems for finite support iterations I.
Preservation theorems for finite support iterations II.
Absolute sets and the Decomposition Theorem
On Gallai's decomposition theorem for graphs
The decomposition theorem: the smooth case
Bounded degree spanning trees
Decomposition theorems
L(Q)-preservation theorems
Identifying preferences in networks with bounded degree
Identifying preferences in networks with bounded degree
Complexity of Normal Forms on Structures of Bounded Degree
Embedding spanning bounded degree graphs in randomly perturbed graphs
Preservation theorems for finite support iterations I.
Preservation theorems for finite support iterations II.
Absolute sets and the Decomposition Theorem
On Gallai's decomposition theorem for graphs