Kreuzungsminimierung in Zeichnungen von aufwärtsgerichteten Graphen

Published by duerrschnabel on

Kreuzungsminimierung in Zeichnungen von aufwärtsgerichteten Graphen

In dieser Arbeit geht es um die Bearbeitung der Challange des Graph Drawing Contests 2020 (http://mozart.diei.unipg.it/gdcontest/contest2020/challenge.html). Hierbei soll ein Algorithmus entwickelt werden, der aufwärts-gerichtete Zeichnungen von azyklischen Graphen generiert. Dabei sollen die Anzahl der Kreuzungen in der generierten Zeichnung minimiert werden.

Informationen: Dominik Dürrschnabel

Categories: AllgemeinMethodischer Schwerpunkt
Tags:

Related Posts

Allgemein

Temporal Ordinal Motifs in Topic Models

Temporal Ordinal Motifs in Topic Models Topic models are, often, dimension reduction techniques for large corpora of textual documents. A central aspect to these models is that they allow for text based explanations of the Read more…

Allgemein

Ordinal Motifs in Hierarchical Topic Models

Ordinal Motifs in Hierarchical Topic Models Topic models are, often, dimension reduction techniques for large corpora of textual documents. A central aspect to these models is that they allow for text based explanations of the Read more…

Allgemein

Network Motifs in Topic Flow Networks

Network Motifs in Topic Flow Networks In scientometrics, scientific collaboration is often analyzed by means of co-authorships. An aspect which is often overlooked and more difficult to quantify is the flow of expertise between authors Read more…