Results 11 to 20 of about 101,745 (269)
Neural Subgraph Isomorphism Counting [PDF]
Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2019 In this paper, we study a new graph learning problem: learning to count subgraph isomorphisms. Different from other traditional graph learning problems such as node classification and link prediction, subgraph isomorphism counting is NP-complete and ...
Xin Liu +4 more
semanticscholar +5 more sources
DotMotif: an open-source tool for connectome subgraph isomorphism search and graph queries [PDF]
Scientific Reports, 2021 Recent advances in neuroscience have enabled the exploration of brain structure at the level of individual synaptic connections. These connectomics datasets continue to grow in size and complexity; methods to search for and identify interesting graph ...
Jordan K. Matelsky +6 more
doaj +2 more sources
AllDifferent-based filtering for subgraph isomorphism [PDF]
Artificial Intelligence, 2010 AbstractThe subgraph isomorphism problem involves deciding if there exists a copy of a pattern graph in a target graph. This problem may be solved by a complete tree search combined with filtering techniques that aim at pruning branches that do not contain solutions. We introduce a new filtering algorithm based on local all different constraints.
Christine Solnon
openalex +3 more sources
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
Ciaran McCreesh +2 more
semanticscholar +2 more sources
Planar Subgraph Isomorphism Revisited [PDF]
, 2009 13 pages, 4 ...
Frederic Dorn
openalex +7 more sources
Solving Graph Homomorphism and Subgraph Isomorphism Problems Faster Through Clique Neighbourhood Constraints [PDF]
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-
Sonja Kraiczy, Ciaran McCreesh
openalex +2 more sources
IEICE Transactions on Information and Systems, 2021 SUMMARY Ising machines have attracted attention as they are expected to solve combinatorial optimization problems at high speed with Ising models corresponding to those problems.
Masashi Tawada +2 more
exaly +2 more sources
Practical Bigraphs via Subgraph Isomorphism [PDF]
International Conference on Principles and Practice of Constraint Programming, 2021 Bigraphs simultaneously model the spatial and non-spatial relationships between entities, and have been used for systems modelling in areas including biology, networking, and sensors.
B. Archibald +3 more
semanticscholar +5 more sources
A Convex Relaxation Bound for Subgraph Isomorphism [PDF]
International Journal of Combinatorics, 2012 In this work a convex relaxation of a subgraph isomorphism problem is proposed, which leads to a new lower bound that can provide a proof that a subgraph isomorphism between two graphs can not be found. The bound is based on a semidefinite programming relaxation of a combinatorial optimisation formulation for subgraph isomorphism and is explained in ...
Christian Schellewald
openalex +3 more sources
Filtering for Subgraph Isomorphism [PDF]
, 2007 A 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 filtering algorithm dedicated to this problem. The main idea is to label every node with respect to its relationships with other nodes of the graph, and to define a partial order on these labels in order to ...
Stéphane Zampelli +4 more
openalex +4 more sources