- Weitere Titel
-
Vergleich und Berechnung von Parametern für gerichtete Graphen
- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Düsseldorf, Heinrich-Heine-Universität, Dissertation, 2022
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Düsseldorf
- (wer)
-
Universitäts- und Landesbibliothek der Heinrich-Heine-Universität Düsseldorf
- (wann)
-
2022
- Urheber
- Beteiligte Personen und Organisationen
-
Gurski, Frank
Wanke, Egon
- URN
-
urn:nbn:de:hbz:061-20220503-134237-7
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:27 MESZ
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
- Rehs, Carolin
- Gurski, Frank
- Wanke, Egon
- Universitäts- und Landesbibliothek der Heinrich-Heine-Universität Düsseldorf
Entstanden
- 2022
Ähnliche Objekte (12)
Typical Sequences Revisited — Computing Width Parameters of Graphs
Directed communication in games with directed graphs
Comparing Fuzzy Graphs
On layering directed acyclic graphs
DAGMA: Mining Directed Acyclic Graphs
Planarity Variants for Directed Graphs
Comparing graphs : Algorithms & applications
Algorithms for computing the 2-vertex-connected components and the 2-blocks of directed graphs
Graph sampling for subgraph counting on directed graphs
Computing and comparing measures of rationality
Cyclic level drawings of directed graphs
Reducing bias through directed acyclic graphs
Typical Sequences Revisited — Computing Width Parameters of Graphs
Directed communication in games with directed graphs
Comparing Fuzzy Graphs
On layering directed acyclic graphs
DAGMA: Mining Directed Acyclic Graphs
Planarity Variants for Directed Graphs
Comparing graphs : Algorithms & applications
Algorithms for computing the 2-vertex-connected components and the 2-blocks of directed graphs
Graph sampling for subgraph counting on directed graphs
Computing and comparing measures of rationality
Cyclic level drawings of directed graphs
Reducing bias through directed acyclic graphs
Typical Sequences Revisited — Computing Width Parameters of Graphs
Directed communication in games with directed graphs
Comparing Fuzzy Graphs
On layering directed acyclic graphs
DAGMA: Mining Directed Acyclic Graphs
Planarity Variants for Directed Graphs
Comparing graphs : Algorithms & applications
Algorithms for computing the 2-vertex-connected components and the 2-blocks of directed graphs
Graph sampling for subgraph counting on directed graphs
Computing and comparing measures of rationality
Cyclic level drawings of directed graphs