A bit-matrix indexed, edge-ordered algorithm for exact subgraph matching on labeled multigraphs is described and benchmarked against SuMGra, Neo4J, and Memgraph.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.DB 1years
2025 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
MultiGraphMatch: a subgraph matching algorithm for multigraphs
A bit-matrix indexed, edge-ordered algorithm for exact subgraph matching on labeled multigraphs is described and benchmarked against SuMGra, Neo4J, and Memgraph.