An extension of ebloc to valued graphs
Bibliographic Data
| ID | 5338469 |
|---|---|
| Authors | M G Everett (0000-0003-2465-1329, South Thames College, corresponding author) |
| Year | 1983 |
| Volume | 5 |
| Issue | 4 |
| Pages | 395-402 |
| Publication date | 1983-12-01 |
| Open Access | Yes |
| Type | ARTICLE |
| Venue | Social Networks (JOURNAL) |
| Journal identifiers | ISSN: 0378-8733 • E-ISSN: 1879-2111 |
| Publisher | Elsevier BV (PUBLISHER) |
| DOI | 10.1016/0378-8733(83)90010-2 |
| OpenAlex | W2084295027 |
| Language | EN |
| Citations received | 5 |
| References cited | 6 |
Algorithm · Extension (predicate logic · Programming language · Computer Science · Constraint Satisfaction and Optimization · Data Management and Algorithms · Data Mining Algorithms and Applications · Theoretical Computer Science
An algorithm for clustering relational data with applications to social network analysis and comparison with multidimensional scaling
Using log linear analysis with network data
A graph theoretic blocking procedure for social networks
Ebloc
Graph theoretic blockings k‐plexes and k‐cutpoints
Social Structure from Multiple Networks. I. Blockmodels of Roles and Positions
| Citations per year | 0.15 |
|---|---|
| Citation span | 1993 - 2015 (23) |
| Highly cited | No |