Constructing Adjacency Arrays from Incidence Arrays

DOI10.1109/IPDPSW.2017.71arXiv1702.07832MaRDI QIDQ6283606FDOQ6283606

Authors: Hayden Jananthan, Karia Dibert, Jeremy Kepner

Publication date: 24 February 2017

Abstract: Graph construction, a fundamental operation in a data processing pipeline, is typically done by multiplying the incidence array representations of a graph,

m a t h b f E_{m} a t h r m i n

and

m a t h b f E_{m} a t h r m o u t

, to produce an adjacency array of the graph,

m a t h b f A

, that can be processed with a variety of algorithms. This paper provides the mathematical criteria to determine if the product

m a t h b f A = m a t h b f E_{m}^{s f T} a t h r m o u t m a t h b f E_{m} a t h r m i n

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

o p l u s

and multiplication

o t i m e s

operations used to perform the array multiplication. Illustrations of the various results possible from different

o p l u s

and

o t i m e s

operations are provided using a small collection of popular music metadata.

This page was built for publication: Constructing Adjacency Arrays from Incidence Arrays

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6283606)