- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- ISSN
-
2192-6247
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
Technische Berichte des Instituts für Informatik der CAU Kiel ; 1501
- Klassifikation
-
Mathematik
- Ereignis
-
Veröffentlichung
- (wo)
-
Kiel
- (wer)
-
Universitätsbibliothek Kiel
- (wann)
-
2015
- Beteiligte Personen und Organisationen
- URN
-
urn:nbn:de:gbv:8:1-zs-00000264-a9
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
15.08.2025, 07:22 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
- Rüegg, Ulf
- Ehlers, Thorsten
- Spönemann, Miro
- Hanxleden, Reinhard von
- Universitätsbibliothek Kiel
Entstanden
- 2015
Ähnliche Objekte (12)
On layering directed acyclic graphs
Minimum-width graph layering revisited
layering people and place
Directed communication in games with directed graphs
Risk-Layering for Indirect Effects
Modeling generalization and specialization with Extended Conceptual Graphs
Planarity Variants for Directed Graphs
DAGMA: Mining Directed Acyclic Graphs
Directed strongly walk-regular graphs
Functional layering and the English progressive
Graph sampling for subgraph counting on directed graphs
Algorithmic methods for lowest common ancestor problems in directed acyclic graphs
On layering directed acyclic graphs
Minimum-width graph layering revisited
layering people and place
Directed communication in games with directed graphs
Risk-Layering for Indirect Effects
Modeling generalization and specialization with Extended Conceptual Graphs
Planarity Variants for Directed Graphs
DAGMA: Mining Directed Acyclic Graphs
Directed strongly walk-regular graphs
Functional layering and the English progressive
Graph sampling for subgraph counting on directed graphs
Algorithmic methods for lowest common ancestor problems in directed acyclic graphs
On layering directed acyclic graphs
Minimum-width graph layering revisited
layering people and place
Directed communication in games with directed graphs
Risk-Layering for Indirect Effects
Modeling generalization and specialization with Extended Conceptual Graphs
Planarity Variants for Directed Graphs
DAGMA: Mining Directed Acyclic Graphs
Directed strongly walk-regular graphs
Functional layering and the English progressive
Graph sampling for subgraph counting on directed graphs