,
Fabrizio Montecchiani
,
Andrea Tomassoni
Creative Commons Attribution 4.0 International license
Dense graphs are hard to read because many edges compete for the same visual space. BioFabric reduces this problem by drawing nodes as horizontal lines and edges as vertical segments, removing edge crossings by design. However, its readability still depends strongly on the ordering of nodes and edges. In this paper, we focus on clique motifs in BioFabric. Since every pair of nodes in a clique is connected, drawing all clique edges can add visual clutter without adding much information once the clique is known. A compact square or rectangular mark can instead indicate the clique as a dense region of the network. This only works, however, when the layout places the clique nodes and edges close enough to form a contiguous region. We model this as an optimization problem and introduce an integer linear programming formulation that computes node orderings designed to make clique motifs compact. We provide a quantitative evaluation to show the scalability and results obtained with the method. Our approach extends recent work on BioFabric layout optimization from staircase motifs to clique motifs, with particular attention to overlapping cliques, where several compact regions compete for the same rows.
@InProceedings{dibartolomeo_et_al:LIPIcs.GD.2026.19,
author = {Di Bartolomeo, Sara and Montecchiani, Fabrizio and Tomassoni, Andrea},
title = {{Clic: Highlighting Clique Motifs in Biofabric Visualizations}},
booktitle = {34th International Symposium on Graph Drawing and Network Visualization (GD 2026)},
pages = {19:1--19:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-452-9},
ISSN = {1868-8969},
year = {2026},
volume = {396},
editor = {L\"{o}ffler, Maarten and Miksch, Silvia},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.GD.2026.19},
URN = {urn:nbn:de:0030-drops-279144},
doi = {10.4230/LIPIcs.GD.2026.19},
annote = {Keywords: Biofabric, Clique Visualization, Clustered Graphs, Integer Linear Programming, Motif Simplification}
}
archived version
archived version