A Faster Katz Status Score Algorithm
Source: Computational & Mathematical Organization Theory, Volume 7, Number 4, December 2001 , pp. 275-285(11)
A new graph theoretical algorithm to calculate Katz status scores reduces computational complexity from time O(n^3) to O(n + m). Randomly-generated graphs as well as data from a large empiric study are used to test the performance of two commercial network analysis packages (GRADAP and UCINET V), compared to the performance achieved by the authors' algorithm, implemented in Visual Basic.
Document Type: Regular paper
Affiliations: 1: Private Consultants, Colorado Springs, CO, USA 2: Private Consultants, Colorado Springs, CO, USA. firstname.lastname@example.org 3: El Paso County Department of Health, Colorado Springs, CO, USA. email@example.com 4: Emory University School of Medicine, Atlanta, GA, USA. firstname.lastname@example.org
Publication date: 2001-12-01