- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
Passau, Univ., Diss., 2010
- Classification
-
Informatik
- Keyword
-
Graphenzeichnen ; Gerichteter Graph ; Kreis ; Planarer Graph
- Creator
- URN
-
urn:nbn:de:bvb:739-opus-17962
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:46 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Object type
- Hochschulschrift
Associated
Other Objects (12)
Planarity Variants for Directed Graphs
DAGMA: Mining Directed Acyclic Graphs
On layering directed acyclic graphs
Graph sampling for subgraph counting on directed graphs
Quality Metrics for Symmetric Graph Drawings
Planar L-Drawings of Bimodal 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
Planarity Variants for Directed Graphs
DAGMA: Mining Directed Acyclic Graphs
On layering directed acyclic graphs
Graph sampling for subgraph counting on directed graphs
Quality Metrics for Symmetric Graph Drawings
Planar L-Drawings of Bimodal 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
Planarity Variants for Directed Graphs
DAGMA: Mining Directed Acyclic Graphs
On layering directed acyclic graphs
Graph sampling for subgraph counting on directed graphs
Quality Metrics for Symmetric Graph Drawings
Planar L-Drawings of Bimodal 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