Software Engineering and Scale-Free Networks

File Size Format
52497_1.pdf 784Kb Adobe PDF View
Title Software Engineering and Scale-Free Networks
Author Wen, Larry; Dromey, Geoff; Kirk, Diana
Journal Name I E E E Transactions on Systems, Man and Cybernetics, Part B: Cybernetics
Year Published 2009
Place of publication New York
Publisher IEEE
Abstract Complex-network theory is a new approach in studying different types of large systems in both the physical and the abstract worlds. In this paper, we have studied two kinds of network from software engineering: the component dependence network and the sorting comparison network (SCN). It is found that they both show the same scale-free property under certain conditions as complex networks in other fields. These results suggest that complex-network theory can be a useful approach to the study of software systems. The special properties of SCNs provide a more repeatable and deterministic way to study the evolution and optimization of complex networks. They also suggest that the closer a sorting algorithm is to the theoretical optimal limit, the more its SCN is like a scale-free network. This may also indicate that, to store and retrieve information efficiently, a concept network might need to be scale-free.
Peer Reviewed Yes
Published Yes
Publisher URI http://ieeexplore.ieee.org/xpl/RecentIssue.jsp?punumber=3477
Alternative URI http://dx.doi.org/10.1109/TSMCB.2008.2008102
Copyright Statement Copyright 2009 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.
Volume 39
Issue Number 3
Page from 648
Page to 657
ISSN 1083-4419
Date Accessioned 2009-03-11
Language en_AU
Research Centre Institute for Integrated and Intelligent Systems
Faculty Faculty of Science, Environment, Engineering and Technology
Subject PRE2009-Analysis of Algorithms and Complexity; PRE2009-Software Engineering
URI http://hdl.handle.net/10072/25961
Publication Type Journal Articles (Refereed Article)
Publication Type Code c1

Show simple item record

Griffith University copyright notice