Results 11 to 20 of about 39,682 (219)
Solving Graph Homomorphism and Subgraph Isomorphism Problems Faster Through Clique Neighbourhood Constraints [PDF]
Proceedings of the Thirtieth International Joint Conference on Artificial Intelligence, 2021 Graph homomorphism problems involve finding adjacency-preserving mappings between two given graphs. Although theoretically hard, these problems can often be solved in practice using constraint programming algorithms. We show how techniques from the state-of-the-art in subgraph isomorphism solving can be applied to broader graph homomorphism problems ...
Sonja Kraiczy, Ciaran McCreesh
openalex +3 more sources
HyGraph: a subgraph isomorphism algorithm for efficiently querying big graph databases
Journal of Big Data, 2022 The big graph database provides strong modeling capabilities and efficient querying for complex applications. Subgraph isomorphism which finds exact matches of a query graph in the database efficiently, is a challenging problem.
Merve Asiler, Adnan Yazıcı, Roy George
doaj +2 more sources
Solving subgraph isomorphism problems with constraint programming [PDF]
Constraints, 2009 The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated filtering algorithm to solve this problem within the context of constraint programming.
Stéphane Zampelli +2 more
openalex +7 more sources
Theoretical Computer Science, 1989 AbstractWe consider the problems of subgraph homeomorphism with fixed pattern, disjoint connecting paths with bounded number of terminal pairs, recognition, and subgraph isomorphism for some classes of planar graphs. Following the results of Robertson and Seymour on forbidden minor characterization, we show that the first three of the above problems ...
Andrzej Lingas, Andrzej Proskurowski
openalex +3 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
openalex +3 more sources
GRAPH-SUBGRAPH ISOMORPHISM PROBLEM SOLVING FOR DESIGNING SPECIAL COMPUTERS
Radio Electronics, Computer Science, Control, 2012 An advanced algorithm for solving graphs isomorphism problem is proposed and experimental results of its efficiency are presented. Object of investigation is set of control flow graphs of solutions achieved, that were received after circumvent of the semantic network by Warren abstract machine.
Matviy Ilyashenko, A.A. Goldobin
openalex +4 more sources
The Subgraph Isomorphism Problem on a Class of Hyperedge Replacement Languages [PDF]
International Conference on Graph Transformation, 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 +4 more sources
IEICE Transactions on Information and Systems, 2021 Natsuhito Yoshimura +6 more
openalex +4 more sources
Current Algorithms for Detecting Subgraphs of Bounded Treewidth Are Probably Optimal [PDF]
, 2021 The Subgraph Isomorphism problem is of considerable importance in computer science. We examine the problem when the pattern graph H is of bounded treewidth, as occurs in a variety of applications.
Bringmann, Karl, Slusallek, Jasper
core +4 more sources