Introduction to graph theory
Structural analysis of hypertexts: identifying hierarchies and useful metrics
ACM Transactions on Information Systems (TOIS)
Navigating in hyperspace: designing a structure-based toolbox
Communications of the ACM
Control for hypertext construction
Communications of the ACM
Journal of the American Society for Information Science
The anatomy of a large-scale hypertextual Web search engine
WWW7 Proceedings of the seventh international conference on World Wide Web 7
Authoritative sources in a hyperlinked environment
Journal of the ACM (JACM)
Small-world linkage and co-linkage
Proceedings of the 12th ACM conference on Hypertext and Hypermedia
Hyperlink Analysis for the Web
IEEE Internet Computing
Link analysis, eigenvectors and stability
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
Mathematical and Computer Modelling: An International Journal
Hi-index | 0.00 |
A generalization of both the Botafogo-Rivlin-Shneiderman compactness measure and the Wiener index is presented. These new measures for the cohesion of networks can be used in case a dissimilarity value is given between nodes in a network or a graph. It is illustrated how a set of weights between connected nodes can be transformed into a set of dissimilarity measures for all nodes. The new compactness measure for the cohesion of weighted graphs has several desirable properties related to the disjoint union of two networks. Finally, an example is presented of the calculation of the new compactness measures for a co-citation and a bibliographic coupling network.