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 insoftware libraries and programs, there is little awareness of what is done across all fields. Our survey aims at describing thesereordering algorithms in a unified manner to enable a wide audience to understand their differences and subtleties. We organizethis corpus in a consistent manner, independently of the application or research field. We also provide practical guidance onhow to select appropriate algorithms depending on the structure and size of the matrix to reorder, and point to implementationswhen available.
Original language | English |
---|---|
Pages (from-to) | 693-716 |
Number of pages | 24 |
Journal | Computer Graphics Forum |
Volume | 35 |
Issue number | 3 |
Early online date | 4 Jun 2016 |
DOIs | |
Publication status | Published - Jun 2016 |
Fingerprint
Dive into the research topics of 'Matrix Reordering Methods for Table and Network Visualization'. Together they form a unique fingerprint.Profiles
-
Benjamin Bach
- Institute of Language, Cognition and Computation
- Design Informatics
- Language, Interaction, and Robotics
- School of Informatics - Reader in Data Visualization and Design Informatics
Person: Academic: Research Active