Privacy-preserving graph matching query supporting quick subgraph extraction
Graph matching, as one of the most fundamental problems in graph database, has a wide
range of applications. Due to the large scale of graph database and the hardness of graph …
range of applications. Due to the large scale of graph database and the hardness of graph …
Ive: accelerating enumeration-based subgraph matching via exploring isolated vertices
The performance of the enumeration-based sub-graph matching, which searches all
isomorphic subgraphs in the data graph, is crucial to various applications. The upper bound …
isomorphic subgraphs in the data graph, is crucial to various applications. The upper bound …
Efficient Graph Isomorphism Query Processing using Degree Sequences and Color-Label Distributions
Given a set of data graphs and a query graph, graph isomorphism query processing is the
problem of finding all the data graphs that are isomorphic to the query graph. Graph …
problem of finding all the data graphs that are isomorphic to the query graph. Graph …
[인용][C] 그래프 동형 문제를 위한 최신 알고리즘 비교
김민형， 이민제， 송시우， 박근수 - 정보과학회 컴퓨팅의 실제 논문지, 2023 - dbpia.co.kr
요 약 최근 제시된 그래프 동형 문제를 빠르게 푸는 알고리즘인 CRaB 과 DviCL 을 여러 쿼리
그래프에서 실행하여 그 실행 속도를 비교 분석하였다. CRaB 은 백트래킹을 통해 그래프 …
그래프에서 실행하여 그 실행 속도를 비교 분석하였다. CRaB 은 백트래킹을 통해 그래프 …