Weighted Adjacency
Weighted Adjacency is a graph-theoretic construct in adjacency analysis that characterizes pairwise relationships between nodes by assigning numerical weights to edges, thereby quantifying the strength, intensity, or capacity of connections in contrast to unweighted adjacency which merely indicates presence or absence of a link.
63
Publications
3.1K
Citations
199
Authors
128
Institutions
Publications per year
2017–2026
33
Parents
63
A min-max cut algorithm for graph partitioning and data clustering
Chris Ding, Xiaofeng He, Hongyuan Zha et al. · 2002 · 831 citations
A decentralized algorithm for spectral analysis
David Kempe, Frank McSherry · 2004 · 124 citations
1–5 of 63
199
3
h-index
3
h-index
2
h-index
2
h-index
2
h-index
1–5 of 199
128

University of York
York, United Kingdom
3 h-index
5 publications
98 citations

Pennsylvania State University
State College, United States
2 h-index
3 publications
1.7K citations

China University of Geosciences (Beijing)
Beijing, China
2 h-index
6 publications
284 citations

Shanghai Jiao Tong University
Shanghai, China
2 h-index
9 publications
1.1K citations
Fudan University
Shanghai, China
2 h-index
3 publications
167 citations
Michigan State University
East Lansing, United States
2 h-index
7 publications
88 citations
Xiamen University
Xiamen, China
2 h-index
4 publications
89 citations
Politecnico di Torino
Turin, Italy
2 h-index
2 publications
25 citations
1–8 of 128
2 publications · 93 citations
2
h-index
1 publications · 54 citations
1
h-index
1 publications · 22 citations
1
h-index
1 publications · 18 citations
1
h-index
1 publications · 14 citations
1
h-index
1–5