B. Szawulak, P. Formanowicz
Graphlets represents an interesting approach to graph comparison based on distribution of small nonisomorphic structures (graphlets) inside two compared graphs. Graphlet Degree Distribution Agreement (GDDA) is a metric that was created for comparison of large graphs for which standard approaches are not efficient. Unfortunately, for graph characterized as low edge density structures GDDA was reported to become too sensitive. Because models created by use of Petri nets usually represent structures with total number of nodes up to a few hundreds, while original graphs have a few thousands vertices, they might be subjected to this problem. We have proposed new graphlets for biparted directed environment of Petri nets and performed tests based on GDDA metric to evaluate their usefulness .
Keywords: Petri nets, Graph comparison, GraphletsScheduled
FB1 Graphs and Networks 2
June 11, 2021 10:45 AM
1 - GB Dantzig