- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
RWTH Aachen University, Dissertation, 2022
- Schlagwort
-
Graph
Online-Algorithmus
Graphenzeichnen
Algorithmus
- Ereignis
-
Veröffentlichung
- (wo)
-
Aachen
- (wer)
-
Universitätsbibliothek der RWTH Aachen
- (wann)
-
2022
- Urheber
- Beteiligte Personen und Organisationen
- DOI
-
10.18154/RWTH-2022-08761
- URN
-
urn:nbn:de:101:1-2022100601344109488542
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:49 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
- Fuchs, Janosch
- Unger, Walter
- Komm, Dennis
- Rossmanith, Peter
- Universitätsbibliothek der RWTH Aachen
Entstanden
- 2022
Ähnliche Objekte (12)
Crossing minimization in automatic graph drawing
Preserving Order during Crossing Minimization in Sugiyama Layouts
Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization
Drawing Dynamic Graphs by Stress Minimization
Collective graph exploration
Efficient graph exploration
Collective graph exploration
Collaborative graph exploration
Collective graph exploration
Towards a structure theorem for crossing-critical graphs
An exploration of the role of advice exchanges in supply management
Condorcet domains, median graphs and the single-crossing property
Crossing minimization in automatic graph drawing
Preserving Order during Crossing Minimization in Sugiyama Layouts
Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization
Drawing Dynamic Graphs by Stress Minimization
Collective graph exploration
Efficient graph exploration
Collective graph exploration
Collaborative graph exploration
Collective graph exploration
Towards a structure theorem for crossing-critical graphs
An exploration of the role of advice exchanges in supply management
Condorcet domains, median graphs and the single-crossing property
Crossing minimization in automatic graph drawing
Preserving Order during Crossing Minimization in Sugiyama Layouts
Exact and Heuristic Algorithms for 2-Layer Straightline Crossing Minimization
Drawing Dynamic Graphs by Stress Minimization
Collective graph exploration
Efficient graph exploration
Collective graph exploration
Collaborative graph exploration
Collective graph exploration
Towards a structure theorem for crossing-critical graphs
An exploration of the role of advice exchanges in supply management