Results 1 to 10 of about 39,682 (219)
The Glasgow Subgraph Solver: Using Constraint Programming to Tackle Hard Subgraph Isomorphism Problem Variants [PDF]
Graph Transformation13th International Conference, 2020 The Glasgow Subgraph Solver provides an implementation of state of the art algorithms for subgraph isomorphism problems. It combines constraint programming concepts with a variety of strong but fast domain-specific search and inference techniques, and is suitable for use on a wide range of graphs, including many that are found to be computationally ...
McCreesh C, Prosser P, Trimble J.
europepmc +7 more sources
Recursive-Parallel Algorithm for Solving the Graph-Subgraph Isomorphism Problem
Моделирование и анализ информационных систем, 2022 The paper proposes a parallel algorithm for solving the Graph-Subgraph Isomorphism Problem and makes an experimental study of its efficiency. The problem is one of the most famous NP-complete problems.
Vladimir V. Vasilchikov
doaj +5 more sources
SEARCH-TREE SIZE ESTIMATION FOR THE SUBGRAPH ISOMORPHISM PROBLEM [PDF]
Acta Electrotechnica et Informatica, 2019 This article addresses the problem of finding patterns in graphs. This is formally defined as the subgraph isomorphism problem and is one of the core problems in theoretical computer science. We consider the counting variation of this problem.
Uroš Čibej, Jurij MIHELIČ
doaj +4 more sources
The Subgraph Isomorphism Problem for Port Graphs and Quantum Circuits [PDF]
arXiv.org, 2023 We study a variant of the subgraph isomorphism problem that is of high interest to the quantum computing community. Our results give an algorithm to perform pattern matching in quantum circuits for many patterns simultaneously, independently of the number of patterns. After a pre-computation step in which the patterns are compiled into a decision tree,
Luca Mondada, Pablo Andrés-Martínez
semanticscholar +5 more sources
PathLAD+: An Improved Exact Algorithm for Subgraph Isomorphism Problem [PDF]
Proceedings of the Thirty-Second International Joint Conference on Artificial Intelligence, 2023 The subgraph isomorphism problem (SIP) is a challenging problem with wide practical applications. In the last decade, despite being a theoretical hard problem, researchers design various algorithms for solving SIP. In this work, we propose three main heuristics and develop an improved exact algorithm for SIP. First, we design a probing search procedure
Yiyuan Wang +3 more
semanticscholar +3 more sources
An Improved Heuristic Method for Subgraph Isomorphism Problem [PDF]
IOP Conference Series: Materials Science and Engineering, 2017 This paper focus on the subgraph isomorphism (SI) problem. We present an improved genetic algorithm, a heuristic method to search the optimal solution. The contribution of this paper is that we design a dedicated crossover algorithm and a new fitness function to measure the evolution process.
Yingzhuo Xiang +3 more
semanticscholar +3 more sources
Efficient Implementation of Color Coding Algorithm for Subgraph Isomorphism Problem [PDF]
Analysis of Experimental Algorithms - Special Event, 2019 We consider the subgraph isomorphism problem where, given two graphs G (source graph) and F (pattern graph), one is to decide whether there is a (not necessarily induced) subgraph of G isomorphic to F. While many practical heuristic algorithms have been developed for the problem, as pointed out by McCreesh et al. [JAIR 2018], for each of them there are
Josef Malı́k +2 more
semanticscholar +7 more sources
GRAPH-SUBGRAPH ISOMORPHISM PROBLEM SOLVING FOR ORGANIZATION RESOURCES DISTRIBUTION
Radio Electronics, Computer Science, Control, 2014 The paper presents graph-analytical approach for organizations resources distribution. It based on graph-subgraph isomorphism algorithm for weighted and labeled graphs and can be considered as development of graph-subgraph isomorphism algorithm for weighted graphs proposed before.
Matviy Ilyashenko
semanticscholar +6 more sources
Subgraph Isomorphism in Planar Graphs and Related Problems [PDF]
Journal of Graph Algorithms and Applications, 2002 27 pages, 6 figures. A preliminary version of this paper appeared at the 6th ACM-SIAM Symp.
David Eppstein
openalex +6 more sources
OrbitSI: An Orbit-based Algorithm for the Subgraph Isomorphism Search Problem
2024 IEEE International Conference on Knowledge Graph (ICKG)The Subgraph Isomorphism (SI) search problem searches for embeddings of a pattern graph within a data graph. Efficient heuristic algorithms for the SI search problem are often structured around a Depth-First Search (DFS) tree-based search to find matching subgraphs.
Syed Ibtisam Tauhidi +3 more
semanticscholar +4 more sources