Graph Neural Networks for Graph Drawing

doi:10.1109/TNNLS.2022.3184967

Graph Neural Networks for Graph Drawing

2024-04-01

13

OA

AI

DOI：10.1109/TNNLS.2022.3184967

Original

Original request for help

Save

Abstract

En 中文

Graph drawing techniques have been developed in the last few years with the purpose of producing esthetically pleasing node-link layouts. Recently, the employment of differentiable loss functions has paved the road to the massive usage of gradient descent and related optimization algorithms. In this article, we propose a novel framework for the development of Graph Neural Drawers (GNDs), machines that rely on neural computation for constructing efficient and complex maps. GND is Graph Neural Networks (GNNs) whose learning process can be driven by any provided loss function, such as the ones commonly employed in Graph Drawing. Moreover, we prove that this mechanism can be guided by loss functions computed by means of feedforward neural networks, on the basis of supervision hints that express beauty properties, like the minimization of crossing edges. In this context, we show that GNNs can nicely be enriched by positional features to deal also with unlabeled vertexes. We provide a proof-of-concept by constructing a loss function for the edge crossing and provide quantitative and qualitative comparisons among different GNN models working under the proposed framework.

Keywords:

Graph drawing

Layout

Stress

Neural networks

Optimization

Iterative methods

Graph neural networks

Graph Drawing

Graph Neural Drawers (GNDs)

Graph Neural Networks (GNNs)

graph representation learning

Graph Neural Networks for Graph Drawing

Abstract

Journal

Organization