<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:cc="http://web.resource.org/cc/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="http://www.bibsonomy.org/user/diego_ma/directed_graph_isomorphism"><title>BibSonomy publications for /user/diego_ma/directed_graph_isomorphism</title><link>http://www.bibsonomy.org/publrss/user/diego_ma/directed_graph_isomorphism</link><description>BibSonomy RSS Feed for /user/diego_ma/directed_graph_isomorphism</description><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/210dc5894dcaaf52087bfd2374d849c66/diego_ma"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/210dc5894dcaaf52087bfd2374d849c66/diego_ma"><title>An Algorithm for Subgraph Detection</title><link>http://www.bibsonomy.org/bibtex/210dc5894dcaaf52087bfd2374d849c66/diego_ma</link><dc:creator>diego_ma</dc:creator><dc:date>2007-12-14T02:47:31+01:00</dc:date><dc:subject>graph_isomorphism directed_graph_isomorphism search_tree clique_detection subgraph_isomorphism algorithm game_tree clique subgraph graph isomorphism asynchronous_sequential_circuits special_purpose_computer tree_search logic-in-memory_arrays digraph_isomorphism Boolean_matrices array_processing parallel_processing </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;J.R. &lt;a href=&#034;http://www.bibsonomy.org/author/Ullmann&#034;&gt;Ullmann&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Journal of the ACM&lt;/em&gt;&lt;em&gt;23(1):31-42&lt;/em&gt;(&lt;em&gt;1976&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph_isomorphism"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/directed_graph_isomorphism"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search_tree"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clique_detection"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/subgraph_isomorphism"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/game_tree"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clique"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/subgraph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/isomorphism"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/asynchronous_sequential_circuits"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/special_purpose_computer"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tree_search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/logic-in-memory_arrays"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/digraph_isomorphism"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/Boolean_matrices"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/array_processing"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/parallel_processing"/></rdf:Bag></taxo:topics></item></rdf:RDF>