http://www.bibsonomy.org/burst/user/diego_ma/directed_graph_isomorphismBibSonomy BuRST Feed for /user/diego_ma/directed_graph_isomorphism2008-10-07T19:26:00+02:00http://www.bibsonomy.org/bibtex/210dc5894dcaaf52087bfd2374d849c66/diego_madiego_ma2007-12-14T02:47:31+01:00parallel_processing graph_isomorphism array_processing Boolean_matrices subgraph_isomorphism subgraph isomorphism digraph_isomorphism algorithm clique_detection directed_graph_isomorphism game_tree graph search_tree clique asynchronous_sequential_circuits tree_search special_purpose_computer logic-in-memory_arrays <span style="color:#555555;">J.R. <a href="http://www.bibsonomy.org/author/Ullmann">Ullmann</a> </span><em>Journal of the ACM</em><em>23(1):31-42</em>(<em>1976</em>)Fri Dec 14 02:47:31 CET 2007Journal of the ACM131-42An Algorithm for Subgraph Detection231976parallel_processing graph_isomorphism array_processing Boolean_matrices subgraph_isomorphism subgraph isomorphism digraph_isomorphism algorithm clique_detection directed_graph_isomorphism game_tree graph search_tree clique asynchronous_sequential_circuits tree_search special_purpose_computer logic-in-memory_arrays Subgraph isomorphism can be determined by means of a brute-force tree-search enumeration procedure. In this paper a new algorithm is introduced that attains efficiency by inferentially eliminating succesor nodes in the tree search. To assess the time actually taken by the new algorithm, subgraph isomorphism, clique detection, graph isomorphism, and directed graph isomorphism experiments have been carried out with random and with various nonrandom graphs. A parallel asynchronous logic-in-memory implementation of a vital part of the algorithm is also described, although this hardware has not actually been built. The hardware implementation would allow very rapid determination of isomorphism.