2017/02/25 by Hayden Jananthan, Karia Dibert, Jeremy Kepner
Computer Science · Engineering · Mathematics · #Adjacency list #Adjacency matrix #Array processing #Graph #Multiplication (music) #Music Technology and Sound Studies #Music and Audio Processing #Product (mathematics) #VLSI and FPGA Design Techniques #Variety (cybernetics) #cs.DM #cs.DS #math.CO
paper · pdf · doi:10.1109/ipdpsw.2017.71
8 pages, 5 figures, accepted to IEEE IPDPS 2017 Workshop on Graph Algorithm Building Blocks
arxiv created 2017/02/25 · openalex created_date 2017/03/16 · openalex publication_date 2017/05/01 · arxiv updated 2017/09/19 · openalex updated_date 2026/08/05
Graph construction, a fundamental operation in a data processing pipeline, is typically done by multiplying the incidence array representations of a graph, E in and E out, to produce an adjacency array of the graph, A, that can be processed with a variety of algorithms. This paper provides the mathematical criteria to determine if the product A = E T\out E in will have the required structure of the adjacency array of the graph. The values in the resulting adjacency array are determined by the corresponding addition ⊕ and multiplication ⊗ operations used to perform the array multiplication. Illustrations of the various results possible from different ⊕ and ⊗ operations are provided using a small collection of popular music metadata.