Statements (26)
| Predicate | Object |
|---|---|
| gptkbp:instanceOf |
gptkb:graph
|
| gptkbp:complexity |
exponential in worst case
|
| gptkbp:designedBy |
Luigi P. Cordella
|
| gptkbp:feature |
backtracking
memory efficiency efficient pruning state space search with feasibility rules |
| gptkbp:implementedIn |
gptkb:NetworkX
gptkb:Boost_Graph_Library |
| gptkbp:improves |
gptkb:Ullmann's_algorithm
|
| gptkbp:input |
labeled graphs
unlabeled graphs |
| gptkbp:output |
mapping between nodes
|
| gptkbp:publicationYear |
2001
|
| gptkbp:publishedIn |
gptkb:IEEE_Transactions_on_Pattern_Analysis_and_Machine_Intelligence
|
| gptkbp:relatedTo |
graph matching
VF algorithm subgraph isomorphism |
| gptkbp:solvedBy |
gptkb:graph_isomorphism_problem
gptkb:subgraph_isomorphism_problem |
| gptkbp:usedIn |
computer vision
pattern recognition chemoinformatics |
| gptkbp:bfsParent |
gptkb:subgraph_isomorphism_problem
|
| gptkbp:bfsLayer |
7
|
| https://www.w3.org/2000/01/rdf-schema#label |
VF2 algorithm
|