An Improved Algorithm for Matching Large Graphs

By Luigi Pietro Cordella, Pasquale Foggia, Carlo Sansone, Mario Vento. 2001

466 citations recorded by the source corpus.

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

Citations in the corpus

Text Categorization as a Graph Classification Problem (2015, methodology): “In our experiments, we used the standard algorithm VF2 developed by Cordella et al. (2001).”
A survey of frequent subgraph mining algorithms (2012, methodology): “The VF (Cordella et al., 1998) and VF2 (Cordella et al., 2001) algorithms use a Depth First Search (DFS) strategy, assisted by a set of feasibility rules to prune the search tree.”
Graph Based Shapes Representation and Recognition (2007, methodology): “A comparison of frequently used algorithms i.e., best backtracking methods [8] [9], a group theory based Naughty algorithm [10], VF algorithm and VF2 algorithm [11] is given in [12].”
A virtual network mapping algorithm based on subgraph isomorphism detection (2009, methodology): “In contrast to existing approaches, in this paper we propose a backtracking algorithm based on a subgraph isomorphism search method [2] that maps nodes and links during the same stage.”
TrGraph: Cross-Network Transfer Learning via Common Signature Subgraphs (2015, unknown): “In the node classification problem setting, it is assumed that a small set of nodes are required to be labeled through a manual annotation process.”
Thirty Years Of Graph Matching In Pattern Recognition (2004, unknown): “Lades93 [85], Pavlidis95[118], Wiskott97[170], Cho98[26], Duc99[39] Fisher73[51], Kittler89[80], Almohamad93[3], Christamas95[27], Pelillo95 [119], Pelillo95 [120], Gold96[61], Rangarajan96[127], Bomze97[12], Wilson97[167], Pelillo98 [121], Branca99[13], Huet99[71], Medasani99[105], Pelillo99[122, 1”
Language Models of Code are Few-Shot Commonsense Learners (2022, background): “…distance ( GED ): the number of required edits (node/edge removal/additions) to transform ˆ G to G (Abu-Aisheh et al., 2015); • Graph isomorphism ( ISO ; Cordella et al., 2001): determines whether ˆ G and G are isomorphic based on their structure, disregarding the textual content of nodes; •…”
The Index-Based Subgraph Matching Algorithm with General Symmetries (ISMAGS): Exploiting Symmetry for Faster Subgraph Enumeration (2014, methodology): “Well-known algorithms in this class are the Ullmann [11], the VF [12] and the VF2 [13] algorithms.”