Results 131 to 140 of about 3,015 (169)

Subgraph Matching With Effective Matching Order and Indexing

IEEE Transactions on Knowledge and Data Engineering, 2022
Subgraph matching finds all embeddings from a data graph that are identical to a query graph. Recent algorithms work by generating a tree-structured index on the data graph based on the query graph, ordering the vertices root-to-leaf path-by-path in the tree, and enumerating the embeddings following the matching order.
Shixuan Sun, Qiong Luo
openaire   +2 more sources

Subgraph learning for graph matching

Pattern Recognition Letters, 2020
Abstract Graph matching is a powerful tool for computer vision, distance measure and machine learning. However, many factors influences the accuracy of matching. The outliers is a key problem in the process of matching. In this paper, a novel approach is proposed to handle graph matching problem based on Markov Chain Monte Carlo framework.
Weizhi Nie, Hai Ding, Anan Liu, Zonghui Deng, Yuting Su   +4 more
openaire   +1 more source

Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching

Proceedings of the 2021 International Conference on Management of Data, 2021
Subgraph query processing (also known as subgraph search) and subgraph matching are fundamental graph problems in many application domains. A lot of efforts have been made to develop practical solutions for these problems. Despite the efforts, existing algorithms showed limited running time and scalability in dealing with large and/or many graphs.
Hyunjoon Kim, Yunyoung Choi, Kunsoo Park, Xuemin Lin, Seok-Hee Hong, Wook-Shin Han   +5 more
openaire   +1 more source

Efficient distributed subgraph similarity matching

The VLDB Journal, 2015
Given a query graph $$q$$q and a data graph $$G$$G, subgraph similarity matching is to retrieve all matches of $$q$$q in $$G$$G with the number of missing edges bounded by a given threshold $$\epsilon $$∈. Many works have been conducted to study the problem of subgraph similarity matching due to its ability to handle applications involved with noisy or
Yuan, Ye, Wang, Guoren, Xu, Jeffery Yu, Chen, Lei   +3 more
openaire   +2 more sources

Private Subgraph Matching Protocol

2017
In many applications, information can be stored and managed using graph data structures, and there is a rich set of graph algorithms that can be used to solve different problems. The subgraph isomorphism problem is defined as, given two graphs G and H, whether G contains a subgraph that is isomorphic to H.
Zifeng Xu, Fucai Zhou, Yuxi Li, Jian Xu, Qiang Wang   +4 more
openaire   +1 more source

Approximate Constrained Subgraph Matching

2005
Our goal is to build a declarative framework for approximate graph matching where various constraints can be stated upon the pattern graph, enabling approximate constrained subgraph matching, extending models and constraints proposed by Rudolf [1] and Valiente et al. [2].
Stéphane Zampelli, Yves Deville, Pierre Dupont   +2 more
openaire   +1 more source

Connected subgraphs, matching, and partitions

Discrete Mathematics, Algorithms and Applications
Given an undirected graph [Formula: see text] and a real edge-weight vector, the connected subgraph problem consists of finding a maximum-weight subset of edges which induces a connected subgraph of [Formula: see text]. In this paper, we establish a link between the complexity of the connected subgraph problem and the matching number.
Mohamed Didi Biha, Hervé L. M. Kerivin
openaire   +1 more source

Probabilistic Subgraph Matching on Huge Social Networks

2011 International Conference on Advances in Social Networks Analysis and Mining, 2011
Users querying massive social networks or RDF databases are often not 100% certain about what they are looking for due to the complexity of the query or heterogeneity of the data. In this paper, we propose "probabilistic subgraph" (PS) queries over a graph/network database, which afford users great flexibility in specifying "approximately" what they ...
BROCHELER M, PUGLIESE, Andrea, SUBRAHMANIAN VS   +2 more
openaire   +2 more sources

Parallel subgraph matching on massive graphs

2016 9th International Congress on Image and Signal Processing, BioMedical Engineering and Informatics (CISP-BMEI), 2016
While numerous applications, such as social networks, protein-protein interaction networks, and bibliographic networks, mainly consist of graph-structured data, massive graphs, of which the scales range from million nodes to billion nodes, are common-place. Searching within these kinds of graphs is urged to be efficient.
Bo Suo, Zhanhuai Li, Wei Pan
openaire   +1 more source

TC-Match: Fast Time-Constrained Continuous Subgraph Matching

Proceedings of the VLDB Endowment
Continuously monitoring structural patterns in streaming graphs is a critical task in many real-time graph-based applications. In this paper, we study the problem of time-constrained continuous subgraph matching (shorted as TCSM) over streaming graphs.
Jianye Yang, Sheng Fang, Zhaoquan Gu, Ziyi Ma, Xuemin Lin, Zhihong Tian   +5 more
openaire   +1 more source