,
Hugo A. D. do Nascimento
,
Joelma de Moura Ferreira
,
Les Foulds
,
Karsten Klein
,
Falk Schreiber
Creative Commons Attribution 4.0 International license
Edge bundling is a technique commonly used to reduce visual clutter and improve the comprehension of the drawings of large graphs. Here, we model edge bundling as a multi-objective optimization problem and employ clustering strategies, metaheuristic and Pareto analysis to identify non-dominated solutions for some classical graphs from the literature.
@InProceedings{vieira_et_al:LIPIcs.GD.2025.53,
author = {Vieira, Raissa dos Santos and Nascimento, Hugo A. D. do and Ferreira, Joelma de Moura and Foulds, Les and Klein, Karsten and Schreiber, Falk},
title = {{Edge Bundling as a Multi-Objective Optimization Problem}},
booktitle = {33rd International Symposium on Graph Drawing and Network Visualization (GD 2025)},
pages = {53:1--53:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-403-1},
ISSN = {1868-8969},
year = {2025},
volume = {357},
editor = {Dujmovi\'{c}, Vida and Montecchiani, Fabrizio},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2025.53},
URN = {urn:nbn:de:0030-drops-250397},
doi = {10.4230/LIPIcs.GD.2025.53},
annote = {Keywords: Graph Drawing, Edge Bundling, Visual Clutter, Multi-objective Optimization}
}