Results 21 to 30 of about 3,015 (169)
Subgraph Matching on Multiplex Networks
IEEE Transactions on Network Science and Engineering, 2021 An active area of research in computational science is the design of algorithms for solving the subgraph matching problem to find copies of a given template graph in a larger world graph. Prior works have largely addressed single-channel networks using a variety of approaches.
Jacob D. Moorman +4 more
openaire +3 more sources
Discrete Mathematics, 2002 This paper studies a generalisation of matchings called \((1,f)\)-odd subgraphs. The function \(f\) maps vertices of a graph \(G\) to odd natural numbers. A subgraph \(H\) of \(G\) is \((1,f)\)-odd if the degree of each vertex \(v\) in \(H\) is odd and does not exceed \(f(v)\).
Kano M, Katona, Gyula Y.
openaire +1 more source
Structural Equivalence in Subgraph Matching
IEEE Transactions on Network Science and Engineering, 2023 Symmetry plays a major role in subgraph matching both in the description of the graphs in question and in how it confounds the search process. This work addresses how to quantify these effects and how to use symmetries to increase the efficiency of subgraph isomorphism algorithms.
Dominic Yang +5 more
openaire +6 more sources
Entity Alignment Method Based on Neighborhood Aggregation [PDF]
Jisuanji gongcheng, 2022 Entity Alignment(EA) aims to judge whether entities from different Knowledge Graph(KG) are the same object pointing to the real world.However, the structural heterogeneity between KG often affects the accuracy of EA.Hence, an EA method based on a ...
TAN Yuanzhen, LI Xiaonan, LI Guanyu
doaj +1 more source
Subgraph Query Matching in Multi-Graphs Based on Node Embedding
Mathematics, 2022 This paper presents an efficient algorithm for matching subgraph queries in a multi-graph based on features-based indexing techniques. The KD-tree data structure represents these nodes’ features, while the set-trie index data structure represents the ...
Muhammad Anwar +3 more
doaj +1 more source
An Area Partitioning and Subgraph Growing (APSG) Approach to the Conflation of Road Networks
Sensors, 2022 A road network represents a set of road objects in a geographic area and their interconnections, and it is an essential component of intelligent transportation systems (ITS) enabling emerging new applications such as dynamic route guidance, driving ...
Hoa-Hung Nguyen, Han-You Jeong
doaj +1 more source
Dominance-Partitioned Subgraph Matching on Large RDF Graph
Complexity, 2020 Subgraph matching on a large graph has become a popular research topic in the field of graph analysis, which has a wide range of applications including question answering and community detection.
Bo Ning +4 more
doaj +1 more source
Transplantation and Optimization of Graph Matching Algorithm Based on Domestic DCUHeterogeneous Platform [PDF]
Jisuanji kexueSubgraph matching is a basic graph algorithm that is widely used in various fields such as social networks and graph neural networks.As the scale of graph data grows,there is an increasing need for efficient subgraph matching algorithms.GENEVA is a GPU ...
HAO Meng, TIAN Xueyang, LU Gangzhao, LIU Yi, ZHANG Weizhe, HE Hui
doaj +1 more source
Modular counting of subgraphs: Matchings, matching-splittable graphs, and paths [PDF]
, 2021 23 pages, to appear at ESA ...
Curticapean, Radu +2 more
openaire +4 more sources
TemporalRI: subgraph isomorphism in temporal networks with multiple contacts
Applied Network Science, 2021 Temporal networks are graphs where each edge is associated with a timestamp denoting when two nodes interact. Temporal Subgraph Isomorphism (TSI) aims at retrieving all the subgraphs of a temporal network (called target) matching a smaller temporal ...
Giovanni Micale +3 more
doaj +1 more source