Weighted Graph Matrices
Weighted Graph Matrices is a formal mathematical construct that represents a weighted graph through a matrix in which each entry quantifies the weight of the edge between two vertices, distinguishing it from unweighted adjacency matrices by incorporating edge weights as numerical values rather than binary indicators.
103
Publications
6.2K
Citations
260
Authors
151
Institutions
Publications per year
2017–2026
27
Variants
Weighted Adjacency Matrices
103
On sparse spanners of weighted graphs
Ingo Althöfer, Gautam Das, David Dobkin et al. · Discrete & Computational Geometry · 1993 · 600 citations · Full text
Béla Bollobás, P. Erdös · Ars Combinatoria · 1998 · 565 citations
1–5 of 103
260
Chan Zuckerberg Initiative (United States), United States
3 publications · 439 citations
3
h-index
3
h-index
3
h-index
3
h-index
2
h-index
1–5 of 260
151

Shanghai Jiao Tong University
Shanghai, China
4 h-index
12 publications
541 citations
Nanjing University
Nanjing, China
4 h-index
5 publications
85 citations
Technion – Israel Institute of Technology
Haifa, Israel
4 h-index
6 publications
320 citations
Yale University
New Haven, United States
4 h-index
9 publications
1.7K citations
University of California, Berkeley
Berkeley, United States
4 h-index
9 publications
542 citations
The Ohio State University
Columbus, United States
3 h-index
3 publications
120 citations

Hungarian Academy of Sciences
Budapest, Hungary
3 h-index
4 publications
715 citations
Bielefeld University
Bielefeld, Germany
3 h-index
3 publications
723 citations
1–8 of 151
9 publications · 221 citations
9
h-index
ELA · 4 publications · 91 citations
4
h-index
3 publications · 38 citations
3
h-index
Repository · 4 publications · 203 citations
3
h-index
3 publications · 145 citations
3
h-index
1–5