Graph-based Matrix Ordering
Graph-Based Matrix Ordering is a computational method in parallel numerical linear algebra that uses graph-theoretic representations of matrices to reorder their elements, thereby minimizing fill-in and communication overhead during factorization by exploiting sparsity patterns through vertex partitioning and traversal strategies.
10
Publications
253
Citations
21
Authors
7
Institutions
Publications per year
2017–2026
1
10
1–5 of 10
21
1
h-index
1
h-index
1
h-index
1
h-index
1
h-index
1–5 of 21
7

Universidad de Sevilla
Seville, Spain
1 h-index
2 publications
92 citations
NEC (Japan)
Tokyo, Japan
1 h-index
1 publications
43 citations
Eindhoven University of Technology
Eindhoven, The Netherlands
1 h-index
3 publications
48 citations
The Ohio State University
Columbus, United States
1 h-index
4 publications
44 citations
University of Southampton
Southampton, United Kingdom
1 h-index
1 publications
10 citations

University of Waterloo
Waterloo, Canada
1 h-index
2 publications
40 citations
Princeton University
Princeton, United States
1 h-index
6 publications
78 citations
1–7 of 7
1 publications · 20 citations
1
h-index
1 publications · 13 citations
1
h-index
1 publications · 11 citations
1
h-index
1 publications · 46 citations
1
h-index
QAM · 1 publications · 24 citations
1
h-index
1–5