- 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
-
25.03.2025, 13:48 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
- Rüegg, Ulf
- Ehlers, Thorsten
- Spönemann, Miro
- Hanxleden, Reinhard von
- Universitätsbibliothek Kiel
Entstanden
- 2015
Ähnliche Objekte (12)
The Nucleolus of Directed Acyclic Graph Games
DAGMA: Mining Directed Acyclic Graphs
Planarity Variants for Directed Graphs
On layering directed acyclic graphs
Graph sampling for subgraph counting on directed graphs
Generalization of Binomial Coefficients to Numbers on the Nodes of Graphs
The Outflow Ranking Method for Weighted Directed Graphs
On the Core of Directed Acyclic Graph Games
Algorithmic methods for lowest common ancestor problems in directed acyclic graphs
Cyclic level drawings of directed graphs
The Infimum Problem as a Generalization of the Inclusion Problem for Automata
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
The Nucleolus of Directed Acyclic Graph Games
DAGMA: Mining Directed Acyclic Graphs
Planarity Variants for Directed Graphs
On layering directed acyclic graphs
Graph sampling for subgraph counting on directed graphs
Generalization of Binomial Coefficients to Numbers on the Nodes of Graphs
The Outflow Ranking Method for Weighted Directed Graphs
On the Core of Directed Acyclic Graph Games
Algorithmic methods for lowest common ancestor problems in directed acyclic graphs
Cyclic level drawings of directed graphs
The Infimum Problem as a Generalization of the Inclusion Problem for Automata
A Linear Time Algorithm for the Arc Disjoint Menger Problem in Planar Directed Graphs
The Nucleolus of Directed Acyclic Graph Games
DAGMA: Mining Directed Acyclic Graphs
Planarity Variants for Directed Graphs
On layering directed acyclic graphs
Graph sampling for subgraph counting on directed graphs
Generalization of Binomial Coefficients to Numbers on the Nodes of Graphs
The Outflow Ranking Method for Weighted Directed Graphs
On the Core of Directed Acyclic Graph Games
Algorithmic methods for lowest common ancestor problems in directed acyclic graphs
Cyclic level drawings of directed graphs
The Infimum Problem as a Generalization of the Inclusion Problem for Automata