Results 121 to 130 of about 102,063 (249)
In a distributed environment, the volume of graph database increases quickly because graphs emerge from several autonomous sources. Sub-graph query processing is a challenging problem in distributed environment.
Shaik Fathimabi +2 more
doaj +1 more source
Partial Matching of Large Scale Process Plant Models Using Random Walk on Graphs
3D process plant models(PPMs) in the process industry normally consists of thousands of components. And, there are many similar local structures in the PPM.
Weiwei Mao +4 more
doaj +1 more source
Subgraph Isomorphism in Planar Graphs and Related Problems [PDF]
27 pages, 6 figures. A preliminary version of this paper appeared at the 6th ACM-SIAM Symp.
openaire +6 more sources
Note on Hamiltonicity of Basis Graphs of Even Delta‐Matroids
ABSTRACT We show that the basis graph of an even delta‐matroid is Hamiltonian if it has more than two vertices. More strongly, we prove that for two distinct edges e and f sharing a common end, it has a Hamiltonian cycle using e and avoiding f unless it has at most two vertices or it is a cycle of length at most four.
Donggyu Kim, Sang‐il Oum
wiley +1 more source
FSM-BC-BSP: Frequent Subgraph Mining Algorithm Based on BC-BSP
As graph models become increasingly prevalent in the processing of scientific data, the exploration of effective methods for the mining of meaningful patterns from large-scale graphs has garnered significant research attention. This paper delves into the
Fangling Leng +4 more
doaj +1 more source
Explainable Neural Subgraph Matching With Learnable Multi-Hop Attention
Subgraph matching is a challenging problem with a wide range of applications in drug discovery, social network analysis, biochemistry, and cognitive science.
Duc Q. Nguyen +5 more
doaj +1 more source
This paper introduces the concept of hesitant bipolar-valued fuzzy graph (HBVFG), which captures the two opposing perspectives, namely the positive and negative opinions.
Jambi Ratna Raja +7 more
doaj +1 more source
Systematic benchmark of substructure search in molecular graphs - From Ullmann to VF2
Background Searching for substructures in molecules belongs to the most elementary tasks in cheminformatics and is nowadays part of virtually every cheminformatics software.
Ehrlich Hans-Christian, Rarey Matthias
doaj +1 more source
When Subgraph Isomorphism is Really Hard, and Why This Matters for Graph Databases
The subgraph isomorphism problem involves deciding whether a copy of a pattern graph occurs inside a larger target graph. The non-induced version allows extra edges in the target, whilst the induced version does not.
Ciaran McCreesh +3 more
semanticscholar +1 more source
A Relational view of subgraph isomorphism
This paper presents a novel approach to the problem of finding all subgraph isomorphisms of a (pattern) graph into another (target) graph. A relational formulation of the problem, combined with a representation of relations and graphs by Boolean functions, allows to handle the combinatorial explosion in the case of small pattern graphs and ...
Cortadella, Jordi +1 more
openaire +1 more source

