Efficient subgraph matching: Harmonizing dynamic programming, adaptive matching order, and failing set together
Subgraph matching (or subgraph isomorphism) is one of the fundamental problems in graph
analysis. Extensive research has been done to develop practical solutions for subgraph …
analysis. Extensive research has been done to develop practical solutions for subgraph …
Similarity search in graph databases: A multi-layered indexing approach
We consider in this paper the similarity search problem that retrieves relevant graphs from a
graph database under the well-known graph edit distance (GED) constraint. Formally, given …
graph database under the well-known graph edit distance (GED) constraint. Formally, given …
GHashing: Semantic graph hashing for approximate similarity search in graph databases
Graph similarity search aims to find the most similar graphs to a query in a graph database
in terms of a given proximity measure, say Graph Edit Distance (GED). It is a widely studied …
in terms of a given proximity measure, say Graph Edit Distance (GED). It is a widely studied …
Grand: A fast and accurate graph retrieval framework via knowledge distillation
Graph retrieval aims to find the most similar graphs in a graph database given a query
graph, which is a fundamental problem with many real-world applications in chemical …
graph, which is a fundamental problem with many real-world applications in chemical …
CSI_GED: An efficient approach for graph edit similarity computation
Graph similarity is a basic and essential operation in many applications. In this paper, we
are interested in computing graph similarity based on edit distance. Existing graph edit …
are interested in computing graph similarity based on edit distance. Existing graph edit …
A data-driven decision support system for service completion prediction in last mile logistics
A Pegado-Bardayo, A Lorenzo-Espejo… - … Research Part A: Policy …, 2023 - Elsevier
The growing demand for last mile services (deliveries and pickups) often results in the work
overload of couriers, who are unable to complete all their assigned services within their …
overload of couriers, who are unable to complete all their assigned services within their …
A partition-based approach to structure similarity search
Graphs are widely used to model complex data in many applications, such as bioinformatics,
chemistry, social networks, pattern recognition, etc. A fundamental and critical query …
chemistry, social networks, pattern recognition, etc. A fundamental and critical query …
Efficient structure similarity searches: a partition-based approach
Graphs are widely used to model complex data in many applications, such as bioinformatics,
chemistry, social networks, pattern recognition. A fundamental and critical query primitive is …
chemistry, social networks, pattern recognition. A fundamental and critical query primitive is …
Computing graph edit distance via neural graph matching
Graph edit distance (GED) computation is a fundamental NP-hard problem in graph theory.
Given a graph pair (G 1, G 2), GED is defined as the minimum number of primitive …
Given a graph pair (G 1, G 2), GED is defined as the minimum number of primitive …
Speeding up GED verification for graph similarity search
Graph similarity search retrieves from a database all graphs whose edit distance (GED) to a
query graph is within a threshold. As GED computation is NP-hard, the existing works adopt …
query graph is within a threshold. As GED computation is NP-hard, the existing works adopt …