Algorithms that can accurately determine the similarity of directed graphs often need a heavy overhead. In order to save time and achieve a better balance between performance cost and accuracy, this paper proposes a novel two-stage similarity determination algorithm for directed graphs. The algorithm includes two stages. The first is called as features similarity determination, and the second is called as structural similarity determination. The former can quickly determine the similarity through the general features of directed graphs, and eliminate obviously dissimilar graphs, thus reducing the time cost in total. On the basis of the former filtering result, the similarity determination is further made from the graphic structure to ensure the accuracy of similarity determination. Our test and analysis show that the algorithm can achieve a good balance between accuracy and performance.
A Novel Two-Stage Directed Graph Similarity Determination Algorithm
12.10.2022
1100204 byte
Aufsatz (Konferenz)
Elektronische Ressource
Englisch
AIAA | 1984
|Directed Acyclic Graph Guidance Documentation
NTIS | 2022
|Directed Acyclic Graph Guidance Documentation
NTRS | 2022
|A Graph Anomalies Detection Method Based on Graph Similarity
British Library Online Contents | 2014
|Satellite Mission Instruction Sequence Generation Algorithm Using a Flexible Weighted Directed Graph
DOAJ | 2021
|