New Subgraph Isomorphism Algorithms: Vertex versus Path-at-a-time Matching

04/18/2019
by   Mosab Hassaan, et al.
0

Graphs are widely used to model complicated data semantics in many application domains. In this paper, two novel and efficient algorithms Fast-ON and Fast-P are proposed for solving the subgraph isomorphism problem. The two algorithms are based on Ullman algorithm [Ullmann 1976], apply vertex-at-a-time matching manner and path-at-a-time matching manner respectively, and use effective heuristics to cut the search space. Comparing to the well-known algorithms, Fast-ON and Fast-P achieve up to 1-4 orders of magnitude speed-up for both dense and sparse graph data.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/25/2022

Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching

Subgraph matching is a fundamental problem in various fields that use gr...
research
11/23/2021

A note on Matching-Cut in P_t-free Graphs

A matching-cut of a graph is an edge cut that is a matching. The problem...
research
11/10/2021

Generating faster algorithms for d-Path Vertex Cover

For a constant d, the d-Path Vertex Cover problem (d-PVC) is as follows:...
research
03/20/2014

Sparse Learning over Infinite Subgraph Features

We present a supervised-learning algorithm from graph data (a set of gra...
research
06/20/2022

Mnemonic: A Parallel Subgraph Matching System for Streaming Graphs

Finding patterns in large highly connected datasets is critical for valu...
research
07/11/2016

Efficient Activity Detection in Untrimmed Video with Max-Subgraph Search

We propose an efficient approach for activity detection in video that un...
research
03/04/2019

An application of the Gyárfás path argument

We adapt the Gyárfás path argument to prove that t-2 cops can capture a ...

Please sign up or login with your details

Forgot password? Click here to reset