Matrix Reordering Methods for Table and Network Visualization
Citations Over TimeTop 1% of 2016 papers
Abstract
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.
Related Papers
- → Compressed Adjacency Matrices: Untangling Gene Regulatory Networks(2012)53 cited
- → On adjacency-distance spectral radius and spread of graphs(2019)5 cited
- → Adjacency Maps and Efficient Graph Algorithms(2022)3 cited
- Research of the genetic-clustering algorithm considering the condition of planar adjacency relationship(2005)
- → Scheme Partitioning by Means of Evolutional Procedures Using Symbolic Solution Representation(2017)