Skip to main content
Article thumbnail
Location of Repository

Minnesota supported this project. OPTIMAL CONNECTIONS BETWEEN HIGH-TECH COMPANIES: AN ALGORITHM AND ITS APPLICATIONS *

By Song Yang and Henry Hexmoor

Abstract

Identifying several problems in measuring the strongest path connecting pairs of actors in valued graphs, researchers proposed that average path value (APV) be used to indicate optimal connections between dyads. However, a lack of proper computer algorithm and programming implementation has hindered a wide-range application of the proposed APV solution. We develop a computer algorithm and fully implement it with four JAVA programs, which are available on request. The programs produce an optimal connection matrix, which is subsequently input into UCINET for further multidimensional scaling and clustering analysis. We illustrate this procedure with a data matrix containing 38 organizations in information technology. We discuss our methodological contributions to future social network studies

Topics: Graph theory, Average path value, Computer algorithm, Valued graph 1 OPTIMAL CONNECTIONS BETWEEN HIGH-TECH
Year: 2009
OAI identifier: oai:CiteSeerX.psu:10.1.1.135.2848
Provided by: CiteSeerX
Download PDF:
Sorry, we are unable to provide the full text but you may find it at the following location(s):
  • http://citeseerx.ist.psu.edu/v... (external link)
  • http://www.cs.siu.edu/~hexmoor... (external link)
  • Suggested articles


    To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.