- Alternative title
-
Graphische Modellierung von Extremen
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
München, Technische Universität München, Dissertation, 2018
- Keyword
-
Graphic methods
- Event
-
Veröffentlichung
- (where)
-
München
- (who)
-
Universitätsbibliothek der TU München
- (when)
-
2018
- Creator
-
Gissibl, Nadine
- Contributor
- URN
-
urn:nbn:de:bvb:91-diss-20180921-1444903-1-4
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:45 PM CET
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
- Gissibl, Nadine
- Klüppelberg, Claudia
- Lauritzen, Steffen
- Einmahl, John H. J.
- Universitätsbibliothek der TU München
Time of origin
- 2018
Other Objects (12)
Solving linear graphical constraint expressions
Objective Bayes Factors for Gaussian Directed Acyclic Graphical Models
Planarity Variants for Directed Graphs
DAGMA: Mining Directed Acyclic Graphs
On layering directed acyclic graphs
Graph sampling for subgraph counting on directed graphs
Cyclic level drawings of directed graphs
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Comparing and Computing Parameters for Directed Graphs
Cycle structure and colorings of directed graphs
Finding Disjoint Paths on Directed Acyclic Graphs
Connectivity in directed and undirected infinite graphs
Solving linear graphical constraint expressions
Objective Bayes Factors for Gaussian Directed Acyclic Graphical Models
Planarity Variants for Directed Graphs
DAGMA: Mining Directed Acyclic Graphs
On layering directed acyclic graphs
Graph sampling for subgraph counting on directed graphs
Cyclic level drawings of directed graphs
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Comparing and Computing Parameters for Directed Graphs
Cycle structure and colorings of directed graphs
Finding Disjoint Paths on Directed Acyclic Graphs
Connectivity in directed and undirected infinite graphs
Solving linear graphical constraint expressions
Objective Bayes Factors for Gaussian Directed Acyclic Graphical Models
Planarity Variants for Directed Graphs
DAGMA: Mining Directed Acyclic Graphs
On layering directed acyclic graphs
Graph sampling for subgraph counting on directed graphs
Cyclic level drawings of directed graphs
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
Comparing and Computing Parameters for Directed Graphs
Cycle structure and colorings of directed graphs
Finding Disjoint Paths on Directed Acyclic Graphs