Results 11 to 20 of about 21,959 (221)
Between Subgraph Isomorphism and Maximum Common Subgraph [PDF]
Proceedings of the AAAI Conference on Artificial Intelligence, 2017 When a small pattern graph does not occur inside a larger target graph, we can ask how to find "as much of the pattern as possible" inside the target graph.
Hoffmann, Ruth +2 more
core +3 more sources
Deep Analysis on Subgraph Isomorphism [PDF]
, 2020 Subgraph isomorphism is a well-known NP-hard problem which is widely used in many applications, such as social network analysis and knowledge graph query. Its performance is often limited by the inherent hardness. Several insightful works have been done since 2012, mainly optimizing pruning rules and matching orders to accelerate enumerating all ...
Li Zeng, Yan Jiang, Weixin Lu, Lei Zou
openalex +3 more sources
Optimized Backtracking for Subgraph Isomorphism
International Journal of Database Management Systems, 2012 Subgraph isomorphism is a fundamental graph problem with many important applications. Given two graphs G and SG, the subgraph isomorphism problem is to determine whether G contains a subgraph that is isomorphic to SG. It is well known that the problem is NP complete in the worst case.
Lixin Fu
openalex +2 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
AllDifferent-based filtering for subgraph isomorphism
Artificial Intelligence, 2010 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Christine Solnon
openalex +5 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 +1 more source
Temporal subgraph isomorphism [PDF]
Proceedings of the 2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2013 Temporal information is increasingly available with network data sets. This information can expose underlying processes in the data via sequences of link activations. Examples range from the propagation of ideas through a scientific collaboration network, to the spread of disease via contacts between infected and susceptible individuals.
Ursula Redmond, Pádraig Cunningham
openaire +1 more source
Neural Subgraph Isomorphism Counting [PDF]
Proceedings of the 26th ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, 2020 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 requires more global inference to oversee the whole graph.
Liu, Xin +5 more
openaire +2 more sources
A Zero Knowledge Authentication Protocol Based on Novel Heuristic Algorithm of Dense Induced Subgraphs Isomorphism [PDF]
Engineering and Technology Journal, 2015 Graphs provide an useful mathematical tool for modeling various real world phenomena. Dense graphs arise in many places of interest, for instance the internet and social networks to name just two. The density of a graph should be a real number reflecting
N. M. G. Al-Saidi +2 more
doaj +1 more source
Infinite limits and folding [PDF]
Discrete Mathematics & Theoretical Computer Science, 2005 We study infinite limits of graphs generated by the duplication model for biological networks. We prove that with probability 1, the sole nontrivial connected component of the limits is unique up to isomorphism. We describe certain infinite deterministic
Anthony Bonato, Jeannette Janssen
doaj +1 more source