A Path Algebra for Multi-Relational Graphs
Discrete Mathematics
2011-05-26 v1 Formal Languages and Automata Theory
Abstract
A multi-relational graph maintains two or more relations over a vertex set. This article defines an algebra for traversing such graphs that is based on an -ary relational algebra, a concatenative single-relational path algebra, and a tensor-based multi-relational algebra. The presented algebra provides a monoid, automata, and formal language theoretic foundation for the construction of a multi-relational graph traversal engine.
Keywords
Cite
@article{arxiv.1011.0390,
title = {A Path Algebra for Multi-Relational Graphs},
author = {Marko A. Rodriguez and Peter Neubauer},
journal= {arXiv preprint arXiv:1011.0390},
year = {2011}
}