𝔖 Bobbio Scriptorium
✦   LIBER   ✦

A graph theoretic blocking procedure for social networks

✍ Scribed by Martin G. Everett


Publisher
Elsevier Science
Year
1982
Tongue
English
Weight
978 KB
Volume
4
Category
Article
ISSN
0378-8733

No coin nor oath required. For personal study only.


πŸ“œ SIMILAR VOLUMES


Graph-Theoretic Procedures for Dimension
✍ Marı́a R. Brito; Adolfo J. Quiroz; J.E. Yukich πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 151 KB

We consider the problem of identifying the dimension in which a sample of data points lives, when only their interpoint distances are known. We study as a random variable the average ''reach'' of vertices in the k-nearest-neighbors graph associated to the interpoint distance matrix, and we show how

A neural network graph partitioning proc
✍ C. C. Pain; C. R. E De Oliveira; A. J. H. Goddard πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 300 KB πŸ‘ 2 views

This paper describes a neural network graph partitioning algorithm which partitions unstructured ΓΏnite element/volume meshes as a precursor to a parallel domain decomposition solution method. The algorithm works by ΓΏrst constructing a coarse graph approximation using an automatic graph coarsening me

A graph theoretical approach to complex
✍ A. Sakamoto; H. Kawakami; K. Yoshikawa πŸ“‚ Article πŸ“… 1988 πŸ› Elsevier Science 🌐 English βš– 385 KB

A new method for analyzing the structure of a complex reaction network is proposed using a graph theoretical approach. The structural relation of chemical reactions and species in the network can be determined by a corresponding bipartite graph, and vice versa. Differential equations for the network