Matrix Reordering Methods for Table and Network Visualization

Abstract : This survey provides a description of algorithms to reorder visual matrices of tabular data and adjacency matrix of networks. The goal of this survey is to provide a comprehensive list of reordering algorithms published in different fields such as statistics, bioinformatics, or graph theory. While several of these algorithms are described in publications and others are available in software libraries and programs, there is little awareness of what is done across all fields. Our survey aims at describing these reordering algorithms in a unified manner to enable a wide audience to understand their differences and subtleties. We organize this corpus in a consistent manner, independently of the application or research field. We also provide practical guidance on how to select appropriate algorithms depending on the structure and size of the matrix to reorder, and point to implementations when available.
Type de document :
Article dans une revue
Computer Graphics Forum, Wiley, 2016, 35, pp.24. 〈10.1111/cgf.12935〉
Liste complète des métadonnées

Littérature citée [55 références]  Voir  Masquer  Télécharger
Contributeur : Jean-Daniel Fekete <>
Soumis le : dimanche 5 juin 2016 - 14:51:20
Dernière modification le : vendredi 17 février 2017 - 16:14:29
Document(s) archivé(s) le : mardi 6 septembre 2016 - 10:12:40



Distributed under a Creative Commons Paternité 4.0 International License




Michael Behrisch, Benjamin Bach, Nathalie Henry Riche, Tobias Schreck, Jean-Daniel Fekete. Matrix Reordering Methods for Table and Network Visualization. Computer Graphics Forum, Wiley, 2016, 35, pp.24. 〈10.1111/cgf.12935〉. 〈hal-01326759〉



Consultations de la notice


Téléchargements de fichiers