Graph Neural Networks for Graph Drawing

Abstract

Graph Drawing techniques have been developed in the last few years with the purpose of producing aesthetically 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 paper, we propose a novel framework for the development of Graph Neural Drawers (GND), machines that rely on neural computation for constructing efficient and complex maps. GNDs are 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 unlabelled 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.

Accepted for publication in IEEE Transaction of Neural Networks and Learning Systems (TNNLS) 2022, Special Issue on Deep Neural Networks for Graphs: Theory, Models, Algorithms and Applications

References in corpus (18)

• Adam: A Method for Stochastic Optimization
• A Comprehensive Survey on Graph Neural Networks
• Neural Message Passing for Quantum Chemistry
• Geometric deep learning: going beyond Euclidean data
• T-GCN: A Temporal Graph ConvolutionalNetwork for Traffic Prediction
• Geometric Deep Learning: Grids, Groups, Graphs, Geodesics, and Gauges
• A Gentle Introduction to Deep Learning for Graphs
• Residual Gated Graph ConvNets
• Principal Neighbourhood Aggregation for Graph Nets
• Benchmarking Graph Neural Networks
• Invariant and Equivariant Graph Networks
• Position-aware Graph Neural Networks
• A Deep Generative Model for Graph Layout
• A Survey on Graph Drawing Beyond Planarity
• On Positional and Structural Node Features for Graph Neural Networks on Non-attributed Graphs
• A Lagrangian Approach to Information Propagation in Graph Neural Networks
• Weisfeiler and Lehman Go Cellular: CW Networks
• Graph Drawing via Gradient Descent, $(GD{)}^2$

Cited by in corpus (2)

• Position-Sensing Graph Neural Networks: Proactively Learning Nodes Relative Positions
• An Efficient Hybridization of Graph Representation Learning and Metaheuristics for the Constrained Incremental Graph Drawing Problem