Graphical modeling of extremes : Max-linear models on directed acyclic graphs
- Weitere Titel
-
Graphische Modellierung von Extremen
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
München, Technische Universität München, Dissertation, 2018
- Schlagwort
-
Graphic methods
- Ereignis
-
Veröffentlichung
- (wo)
-
München
- (wer)
-
Universitätsbibliothek der TU München
- (wann)
-
2018
- Urheber
-
Gissibl, Nadine
- Beteiligte Personen und Organisationen
- URN
-
urn:nbn:de:bvb:91-diss-20180921-1444903-1-4
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:45 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
- Gissibl, Nadine
- Klüppelberg, Claudia
- Lauritzen, Steffen
- Einmahl, John H. J.
- Universitätsbibliothek der TU München
Entstanden
- 2018
Ähnliche Objekte (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