作者: K. Shearer , H. Bunke , S. Venkatesh , D. Kieronska
DOI: 10.1007/978-3-7091-6487-7_6
关键词: Preprocessor 、 Theoretical computer science 、 Computer science 、 Search engine indexing 、 Graph database 、 Computational complexity theory 、 Time complexity 、 Matching (graph theory) 、 Subgraph isomorphism problem 、 Image retrieval
摘要: Traditionally graph algorithms have been of restricted use due to their exponential computational complexity in the general case. Recently a new class for subgraph isomorphism detection has proposed, one these having quadratic time complexity. These preprocessing step allow rapid matching an input against database model graphs. We present algorithm largest common that provides significant performance improvement over previous algorithms. This is based on work preprocessed by Messmer and Bunke [3].