- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
In: First publ. in: IADIS European Conference on Data Mining 2008, Amsterdam, The Netherlands, 24. - 26. July 2008. IADIS Press, 2008, pp. 11-18
- Klassifikation
-
Informatik
- Ereignis
-
Veröffentlichung
- (wo)
-
Konstanz
- (wer)
-
Bibliothek der Universität Konstanz
- (wann)
-
2009
- Beteiligte Personen und Organisationen
- URN
-
urn:nbn:de:bsz:352-opus-77498
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:57 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
- Werth, Tobias
- Dreweke, Alexander
- Wörlein, Marc
- Fischer, Ingrid
- Philippsen, Michael
- Bibliothek der Universität Konstanz
Entstanden
- 2009
Ähnliche Objekte (12)
Planarity Variants for Directed Graphs
On layering directed acyclic graphs
Graph sampling for subgraph counting on directed graphs
Information-theoretic graph mining
Cyclic level drawings of 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
Representing Standard Text Formulations as Directed Graphs
The Nucleolus of Directed Acyclic Graph Games
A Generalization of the Directed Graph Layering Problem
Planarity Variants for Directed Graphs
On layering directed acyclic graphs
Graph sampling for subgraph counting on directed graphs
Information-theoretic graph mining
Cyclic level drawings of 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
Representing Standard Text Formulations as Directed Graphs
The Nucleolus of Directed Acyclic Graph Games
A Generalization of the Directed Graph Layering Problem
Planarity Variants for Directed Graphs
On layering directed acyclic graphs
Graph sampling for subgraph counting on directed graphs
Information-theoretic graph mining
Cyclic level drawings of 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
Representing Standard Text Formulations as Directed Graphs
The Nucleolus of Directed Acyclic Graph Games