Subgraph Isomorphism: Prolog vs. Conventional

TL;DR

This paper compares Prolog-based logic programming with conventional methods for solving subgraph isomorphism problems, highlighting the efficiency and complexity differences as graph size increases.

Contribution

It demonstrates that logic programming in Prolog can be an effective approach for complex subgraph isomorphism problems compared to traditional methods.

Findings

Prolog-based approach handles complex patterns efficiently.

Complexity increases with graph size, but logic programming remains effective.

Conventional methods may be less scalable for complex patterns.

Abstract

Subgraph Isomorphism uses a small graph as a pattern to identify within a larger graph a set of vertices that have matching edges. This paper addresses a logic program written in Prolog for a specific relatively complex graph pattern for which multiple conventional implementations (including parallel) exist. The goal is to understand the complexity differences between programming logically and programming conventionally. Discussion includes the process of converting the graph pattern into logic statements in Prolog, and the resulting characteristics as the size of the graph increased. The analysis shows that using a logic paradigm is an efficient way to attack complex graph problems.