Loading...
Please wait, while we are loading the content...
Similar Documents
A Parallel Algorithm for Finding Subgraph Isomorphism
| Content Provider | Semantic Scholar |
|---|---|
| Author | Sharma, Ashish Bahir, Santosh Narsale, Sushant Tambe, Unmil |
| Copyright Year | 2008 |
| Abstract | There are a number of algorithms and programs present to find Subgraph Isomorphism. For real world applications of graphs like imaging, biocomputing, information retrieval, the graph often consists of large number of nodes. Algorithms for finding subgraph isomorphism for graphs of these scales are processor intensive and time consuming. In this project, we attempt to solve this problem by parallelizing a popular algorithm for finding subgraph isomorphism by Ullmann. A serial implementation of the algorithm is written and benchmarked. The algorithm is studied to find parts that can be parallelized and a new parallel implementation is developed to be run on Google's Map-Reduce. The comparison of the efficiency of both methods is discussed at the end of this report. |
| File Format | PDF HTM / HTML |
| Alternate Webpage(s) | http://www.cs.jhu.edu/~snarsal/CS420-ProjectReport.pdf |
| Language | English |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
