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.


    Access

    Check access

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    A Novel Two-Stage Directed Graph Similarity Determination Algorithm


    Contributors:
    Hongwei, Zhou (author) / Xiaojie, Huang (author) / Zhipeng, Ke (author) / Yuchen, Zhang (author) / Jinhui, Yuan (author)


    Publication date :

    2022-10-12


    Size :

    1100204 byte




    Type of media :

    Conference paper


    Type of material :

    Electronic Resource


    Language :

    English



    Directed Graph Methodology

    LANIER, E. / HINKEY, M. | AIAA | 1984


    Directed Acyclic Graph Guidance Documentation

    E. L. Antonsen / R. J. Reynolds / A. Monti et al. | NTIS | 2022


    A Graph Anomalies Detection Method Based on Graph Similarity

    Li, T. / Xiao, N. | British Library Online Contents | 2014


    Directed Acyclic Graph Guidance Documentation

    Erik L Antonsen / Robert J Reynolds / Avalon Monti et al. | NTRS | 2022


    Satellite Mission Instruction Sequence Generation Algorithm Using a Flexible Weighted Directed Graph

    Zhang Yahang / Zhang Jiakai / Yang Mengfei et al. | DOAJ | 2021

    Free access