Property Graph Algorithms

Property graphs are a type of attributed, multi-relational graph where edges are labeled and both vertices and edges can have any number of key/value properties associated with them. They are more complex than standard single-relational graphs due to the presence of different types of vertices and edges. This complexity affects how graph algorithms are defined and evaluated. Property graph software often supports common centrality algorithms, but their implementation may vary depending on the specific structure of the property graph. The power of property graph algorithms lies in the ability to calculate numerous eigenvector centralities for the same property graph instance by considering all the graphs that exist within the graph.