Results 11 to 20 of about 17,360 (200)
The Subgraph Isomorphism Problem for Port Graphs and Quantum Circuits [PDF]
, 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,
Mondada, Luca, Andrés-Martínez, Pablo
openaire +3 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
openaire +4 more sources
The subgraph isomorphism problem for outerplanar graphs
Theoretical Computer Science, 1982 AbstractThis paper deals with the subgraph isomorphism problem for outerplanar graphs (SUBOUTISOM). In general, since trees and forests are outerplanar, SUBOUTISOM is NP-complete. We show that SUBOUTISOM remains NP-complete even when the strongest connectivity requirements are imposed on both graphs.
Maciej M. SysŁ o
openaire +2 more sources
A survey of graph and subgraph isomorphism problems
, 2003 Mémoire numérisé par la Direction des bibliothèques de l'Université de Montréal.
Yaohui Lei
openaire +3 more sources
Theoretical Computer Science, 1989 See the review in Zbl 0643.68086.
Lingas, Andrzej, Proskurowski, Andrzej
openaire +2 more sources
The Subgraph Isomorphism Problem on a Class of Hyperedge Replacement Languages [PDF]
, 2014 A graph class is called A-free if every graph in the class has no graph in the set A as an induced subgraph. Such characterisations by forbidden induced subgraphs are (among other purposes) very useful for determining whether A-free is a subclass of B-free, by determining whether every graph in B has some graph in A as an induced subgraph.
de Ridder, Hendrik Nicolaas +1 more
openaire +3 more sources
Symmetry breaking in the subgraph isomorphism problem
The Subgraph Isomorphism Problem has many applications, including bioinformatics, computer vision and graph databases. Current state-of-the-art solvers using constraints programming techniques can handle cases with up to 1000 pattern vertices and 10,000 target vertices. Symmetry breaking identifies symmetric states during the search process, and avoids
Loughney, Joseph Patrick, Hoffmann, Ruth
openaire +2 more sources
An Efficient Subgraph Isomorphism Solver for Large Graphs
IEEE Access, 2021 For a given pair of pattern and data graphs, the subgraph isomorphism finding problem locates all instances of the pattern graph into the data graph. For a given subgraph isomorphic image of the pattern graph in a data graph, the set of all ordered pairs
Zubair Ali Ansari +2 more
doaj +1 more source
The search for minimal edge 1-extension of an undirected colored graph [PDF]
Известия Саратовского университета. Новая серия: Математика. Механика. Информатика, 2021 Let $G=(V, \alpha, f)$ be a colored graph with a coloring function $f$ defined on its vertices set $V$. Colored graph $G^*$ is an edge $1$-extension of a colored graph $G$ if $G$ could be included into each subgraph taking into consideration the colors ...
Razumovsky, Peter Vladimirovich
doaj +1 more source
Isomorphic Subgraph Search Algorithm Based on Neighborhood Equivalence Class [PDF]
Jisuanji gongcheng, 2017 Node heterogeneous graph is often used as a data model for complex networks.Isomorphic subgraph search is an important problem in heterogeneous graph mining,but existing algorithms have shortcomings in subgraph removal,which reduces the efficiency of ...
ZHANG Yutong,WANG Simeng,CAO Jia
doaj +1 more source