Results 11 to 20 of about 55,019 (192)
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.
Mccreesh, Ciaran +2 more
core +13 more sources
Filtering for Subgraph Isomorphism [PDF]
, 2007 International audienceA 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.
Solnon, Christine +4 more
core +11 more sources
An Algorithm for Subgraph Isomorphism [PDF]
Journal of the ACM, 1976 Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating successor nodes in the tree search.
J. R. Ullmann
core +3 more sources
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 ...
Jiang, Xin +11 more
core +4 more sources
Pattern matching and pattern discovery algorithms for protein topologies [PDF]
, 2001 We describe algorithms for pattern matching and pattern learning in TOPS diagrams (formal descriptions of protein topologies). These problems can be reduced to checking for subgraph isomorphism and finding maximal common subgraphs in a restricted ...
Viksna, J, Gilbert, D
core +7 more sources
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 +2 more sources
Efficient Streaming Subgraph Isomorphism with Graph NeuralNetworks
, 2021 Queries to detect isomorphic subgraphs are important in graphbased data management. While the problem of subgraph isomorphism search has received considerable attention for the static setting of a single query, or a batch thereof, existing approaches do ...
Weidlich, Matthias +5 more
core +1 more source
Large Graph Sampling Algorithm for Frequent Subgraph Mining
IEEE Access, 2021 Large graph networks frequently appear in the latest applications. Their graph structures are very large, and the interaction among the vertices makes it difficult to split the structures into separate multiple structures, thus increasing the difficulty ...
Tianyu Zheng, Li Wang
doaj +1 more source
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 +1 more source
On the First-Order Complexity of Induced Subgraph Isomorphism [PDF]
Logical Methods in Computer Science, 2019 Given a graph $F$, let $I(F)$ be the class of graphs containing $F$ as an induced subgraph. Let $W[F]$ denote the minimum $k$ such that $I(F)$ is definable in $k$-variable first-order logic.
Oleg Verbitsky, Maksim Zhukovskii
doaj +1 more source