Symbolic vs. Connectionist Learning: An Experimental Comparison in a Structured Domain
IEEE Transactions on Knowledge and Data Engineering
Prototype Learning with Attributed Relational Graphs
Proceedings of the Joint IAPR International Workshops on Advances in Pattern Recognition
A large database of graphs and its use for benchmarking graph isomorphism algorithms
Pattern Recognition Letters - Special issue: Graph-based representations in pattern recognition
Processor Acceleration Through Automated Instruction Set Customization
Proceedings of the 36th annual IEEE/ACM International Symposium on Microarchitecture
A (Sub)Graph Isomorphism Algorithm for Matching Large Graphs
IEEE Transactions on Pattern Analysis and Machine Intelligence
Modeling and assessing inference exposure in encrypted databases
ACM Transactions on Information and System Security (TISSEC)
Exact and Approximate Graph Matching Using Random Walks
IEEE Transactions on Pattern Analysis and Machine Intelligence
Automated Custom Instruction Generation for Domain-Specific Processor Acceleration
IEEE Transactions on Computers
GPLAG: detection of software plagiarism by program dependence graph analysis
Proceedings of the 12th ACM SIGKDD international conference on Knowledge discovery and data mining
Shape modeling and matching in identifying protein structure from low-resolution images
Proceedings of the 2007 ACM symposium on Solid and physical modeling
Shape modeling and matching in identifying 3D protein structures
Computer-Aided Design
Rapid design of area-efficient custom instructions for reconfigurable embedded processing
Journal of Systems Architecture: the EUROMICRO Journal
Combining Two Structured Domains for Modeling Various Graph Matching Problems
Recent Advances in Constraints
Semantic web services discovery based on structural ontology matching
International Journal of Web and Grid Services
An active trust model based on zero knowledge proofs for airborne networks
Proceedings of the 5th Annual Workshop on Cyber Security and Information Intelligence Research: Cyber Security and Information Intelligence Challenges and Strategies
A virtual network mapping algorithm based on subgraph isomorphism detection
Proceedings of the 1st ACM workshop on Virtualized infrastructure systems and architectures
Behavior based software theft detection
Proceedings of the 16th ACM conference on Computer and communications security
Change detection in ontologies using DAG comparison
CAiSE'07 Proceedings of the 19th international conference on Advanced information systems engineering
Distributed resources reservation algorithm for GRID networks
PPAM'07 Proceedings of the 7th international conference on Parallel processing and applied mathematics
Constraint-based graph matching
CP'09 Proceedings of the 15th international conference on Principles and practice of constraint programming
Construction and evaluation of coordinated performance skeletons
HiPC'08 Proceedings of the 15th international conference on High performance computing
AllDifferent-based filtering for subgraph isomorphism
Artificial Intelligence
Selecting profitable custom instructions for reconfigurable processors
Journal of Systems Architecture: the EUROMICRO Journal
Semantic comparison of structured visual dataflow programs
Proceedings of the 3rd International Symposium on Visual Information Communication
Dynamic software birthmark for java based on heap memory analysis
CMS'11 Proceedings of the 12th IFIP TC 6/TC 11 international conference on Communications and multimedia security
Extracting and summarizing the frequent emerging graph patterns from a dataset of graphs
Journal of Intelligent Information Systems
The RW2 algorithm for exact graph matching
ICAPR'05 Proceedings of the Third international conference on Advances in Pattern Recognition - Volume Part I
An ontology matching approach to semantic web services discovery
ISPA'06 Proceedings of the 2006 international conference on Frontiers of High Performance Computing and Networking
A DAG comparison algorithm and its application to temporal data warehousing
CoMoGIS'06 Proceedings of the 2006 international conference on Advances in Conceptual Modeling: theory and practice
Morphable structures for reconfigurable instruction set processors
ACSAC'05 Proceedings of the 10th Asia-Pacific conference on Advances in Computer Systems Architecture
ClouDiA: a deployment advisor for public clouds
Proceedings of the VLDB Endowment
SEC'13 Proceedings of the 22nd USENIX conference on Security
Fast exact graph matching using adjacency matrices
Proceedings of the The third workshop on Procedural Content Generation in Games
Pattern mining of cloned codes in software systems
Information Sciences: an International Journal
Querying KEGG pathways in logic
International Journal of Data Mining and Bioinformatics
| Hi-index | 0.00 |
The paper discusses the performance of a graph matching algorithm tailored for dealing with large graphs without using information about the topology of the graphs to be matched. The algorithm, presented in more details in other papers (and publicly available on the WEB as VF), is now discussed with reference to its computational complexity and memory requirements.The performance analysis is carried out by theoretically characterizing the matching time and the required memory in the best and worst cases. The theoretical analysis is completed by tests on a database of graphs randomly generated.The algorithm is compared with the one proposed by J.R. Ullmann: experimental results confirmed the theoretical expectations, highlighting the overall efficiency of the algorithm. Some results obtained by researchers who recently used the algorithm in application domains requiring a massive use of graph matching techniques are finally reported.