Graph Embedding Algorithms and Their Applications

摘要

This report presents several improved algorithms for subgraph identification which are based on modular design that avoids unnecessary backtracking. Various useful heuristics were also employed which allowed a considerable improvement in execution time. Special hardware configuration was also examined. Applications of graph embedding were examined for simplex query structure and partitioning of distributed database for concurrent allocation of resources. This technique was also used in analyzing chemical structures for determining the presence of various subcompounds.