Representations of networks

Authors:
Harvey J. Greenberg;James E. Kalan
Affiliations:
Virginia Polytechnic Institute and State University, Blacksburg, Virginia;Virginia Polytechnic Institute and State University, Blacksburg, Virginia
Venue:
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Year:
1976

Citing 4
Cited 0

A Survey of Indexing Techniques for Sparse Matrices

ACM Computing Surveys (CSUR)
Data Structures: Theory and Practice

Data Structures: Theory and Practice
Aspects of large-scale in-core linear programming

ACM '71 Proceedings of the 1971 26th annual conference
Effect of data representation on efficiency of sparse matrix operations.

Effect of data representation on efficiency of sparse matrix operations.

Quantified Score

Hi-index	0.00

Visualization

Abstract

Bit map and list structures are analyzed for representation of a network, using its adjacency matrix. Storage analysis, with reduction for m-partite networks, reveals a fundamental function of problem dimensions, called the "index threshold." Several examples, from industry and government, are cited to illustrate the analysis. Relative processing merits are studied, and an equation is derived to relate "processing ratio" to the ratio of the index threshold to the index size. Finally, conversion algorithms are presented, designed to minimize extra work space.