mlsanityData to 7 Oct 2026

On the expressive power of linear algebra on graphs

arXiv 1812.04379 ↗First posted 11 Dec 2018cs.DB cs.LOcited by 14

Not on the map. Why?

Abstract (arXiv)

Most graph query languages are rooted in logic. By contrast, in this paper we consider graph query languages rooted in linear algebra. More specifically, we consider MATLANG, a matrix query language recently introduced, in which some basic linear algebra functionality is supported. We investigate the problem of characterising equivalence of graphs, represented by their adjacency matrices, for various fragments of MATLANG. A complete picture is painted of the impact of the linear algebra operations in MATLANG on their ability to distinguish graphs.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). First posted on arXiv 11 Dec 2018.

Builds on

No reference list yet.

Built on by

Cited by year

Citing papers per year: 2021: 1; 2022: 6; 2023: 3; 2024: 4.

14 papers.

Sort: