A subquadratic triad census algorithm for large sparse networks with small maximum degree

被引：79

作者：

Batagelj, V ^{[1
]}

Mrvar, A ^{[1
]}

机构：

[1] Univ Ljubljana, FMF, Dept Math, Ljubljana 1000, Slovenia

来源：

SOCIAL NETWORKS | 2001年 / 23卷 / 03期

关键词：

large networks; triad census; algorithm;

D O I：

10.1016/S0378-8733(01)00035-1

中图分类号：

Q98 [人类学];

学科分类号：

030303 ;

摘要：

In the paper a subquadratic (O (m), m is the number of arcs) triad census algorithm for large and sparse networks with small maximum degree is presented. The algorithm is implemented in the program Pajek. (C) 2001 Elsevier Science B.V. All rights reserved.

引用

页码：237 / 243

页数：7