Fast exact graph matching using adjacency matrices

Authors:
Marlon Etheredge
Affiliations:
Amsterdam University of Applied Sciences, Duivendrechtsekade 36, Amsterdam, The Netherlands
Venue:
Proceedings of the The third workshop on Procedural Content Generation in Games
Year:
2012

Citing 6
Cited 1

An Algorithm for Subgraph Isomorphism

Journal of the ACM (JACM)
Performance Evaluation of the VF Graph Matching Algorithm

ICIAP '99 Proceedings of the 10th International Conference on Image Analysis and Processing
TALE: A Tool for Approximate Large Graph Matching

ICDE '08 Proceedings of the 2008 IEEE 24th International Conference on Data Engineering
Graph Transformation in a Nutshell

Electronic Notes in Theoretical Computer Science (ENTCS)
A tool for fast indexing and querying of graphs

Proceedings of the 20th international conference companion on World wide web
Interactive evolution for the procedural generation of tracks in a high-end racing game

Proceedings of the 13th annual conference on Genetic and evolutionary computation

Generating Emergent Physics for Action-Adventure Games

Proceedings of the The third workshop on Procedural Content Generation in Games

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper introduces a technique of graph subgraph searching, that allows for varied complex subgraphs to be matched in directed or undirected target graphs in a fast and flexible manner. Along with a discussion on the contrast with other known algorithms, benchmarks are presented that compare these known algorithms to the algorithm that is presented in this paper.