论文信息 - A subquadratic triad census algorithm for large sparse networks with small maximum degree

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

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. © 2001 Elsevier Science B.V. All rights reserved. MSC: 91D30; 93A15; 68R10; 05C85; 68W40; 05C90

Vladimir Batagelj | Andrej Mrvar | V. Batagelj | Andrej Mrvar

[1] Vladimir Batagelj,et al. Pajek - Program for Large Network Analysis , 1999 .

[2] John Scott. What is social network analysis , 2010 .

[3] James Moody,et al. Matrix methods for calculating the triad census , 1998 .

[4] Reka Albert,et al. Mean-field theory for scale-free random networks , 1999 .