Skip to main content
SpringerLink
Log in
Book cover

Smart Innovations in Communication and Computational Sciences pp 237–245Cite as

Parallel Approach for Sub-graph Isomorphism on Multicore System Using OpenMP

  • Conference paper
  • First Online:

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 851))

Abstract

Sub-graph can be used to recognize functional and non-functional characteristics in various graph applications. The sub-graph isomorphism is the problem of detection of input graph inside the target graph. However, if the size of graph grows exponentially, the only available solution to this problem is to use parallel or distributed system. This paper presents parallel approach for sub-graph isomorphism on multi-core system using OpenMP. OpenMP and MPI are application programming interfaces used for multi-core system. OpenMP is used for shared memory architecture. In this work, we parallelize the algorithm to improve the performance of the system using different ways: Grouping of similar nodes, reducing the size of groups and finding the path of nodes. The experimental results show that the proposed approach brings the advantage of high-performance parallel hardware system than single CPU-based results. This approach is highly efficient for the large graphs and also for different variety of graphs. This paper extends the work of COPG algorithm by adding the parallelization method.

This is a preview of subscription content, log in via an institution.

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   129.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   169.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

References

  1. Régin, J.-C.: Développement d’outils algorithmiques pour l’Intelligence Artificielle. Application à la chimie organique. Ph.D. thesis, Universit_e Montpellier 2,199

    Google Scholar 

  2. Bonnici, V., et al.: A subgraph isomorphism algorithm and its application to biochemical data. BMC Bioinform. 14(7) (2013)

    Google Scholar 

  3. Damiand, G., et al.: Polynomial algorithms for subisomorphism of nd open combinatorial maps. Comput. Vis. Image Underst. (2011)

    Google Scholar 

  4. Solnon, C., et al.: On the complexity of submap isomorphism and maximum common submap problems. Pattern Recognit. (2015)

    Google Scholar 

  5. Conte, D., et al.: Thirty years of graph matching in pattern recognition. Int. J. Pattern Recogn. Artif. Intell. (2004)

    Google Scholar 

  6. Bondy, J.A., Murty, U.S.R.: Graph Theory with Applications, vol. 290. Macmillan, London (1976)

    Book  MATH  Google Scholar 

  7. Schatz, M., Cooper-Balis, E., Bazinet, A.: Parallel network motif finding. Technical report, University of Maryland Insitute for Advanced Computer Studies (2008)

    Google Scholar 

  8. Ribeiro, P., Silva, F., Lopes, L.: Efficient parallel subgraph counting using g-tries. In: 2010 IEEE International Conference on Cluster Computing (CLUSTER). IEEE (2010)

    Google Scholar 

  9. Ray, A., Holder, L.B.: Efficiency improvements for parallel subgraph miners. In: FLAIRS Conference (2012)

    Google Scholar 

  10. Aparicio, D., Paredes, P., Ribeiro, P.: A scalable parallel approach for subgraph census computation. In: European Conference on Parallel Processing. Springer, Cham (2014)

    Google Scholar 

  11. McCreesh, C., Prosser, P.: A parallel, backjumping subgraph isomorphism algorithm using supplemental graphs. In: International Conference on Principles and Practice of Constraint Programming. Springer, Cham (2015)

    Google Scholar 

  12. Son, M.-Y., Kim, Y.-H., Oh, B.-W.: An efficient parallel algorithm for graph isomorphism on GPU using CUDA (2015)

    Google Scholar 

  13. Shahrivari, S., Jalili, S.: Fast parallel all-subgraph enumeration using multicore machines. Sci. Program. (2015)

    Google Scholar 

  14. Jayaraj, P.B., Rahamathulla, K., Gopakumar, G.: A GPU based maximum common subgraph algorithm for drug discovery applications. In: 2016 IEEE International Parallel and Distributed Processing Symposium Workshops. IEEE (2016)

    Google Scholar 

  15. Augustyniak, P., Ślusarczyk, G.: Graph-based representation of behavior in detection and prediction of daily living activities. Comput. Biol. Med. (2017)

    Google Scholar 

  16. Cordella, L.P., et al.: A (sub)graph isomorphism algorithm for matching large graphs. IEEE Trans. Pattern Anal. Mach. Intell. (2004)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Shri Jagdishprasad Jhabarmal Tibrewala University, Jhunjhunu, Rajasthan, India

    Rachna Somkunwar & Vinod M. Vaze

Authors
  1. Rachna Somkunwar
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vinod M. Vaze
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Rachna Somkunwar .

Editor information

Editors and Affiliations

  1. Computer Science and Engineering Department, ABES Engineering College, Ghaziabad, Uttar Pradesh, India

    Shailesh Tiwari

  2. Department of Information Technology, Rajkiya Engineering College, Azamgarh, Uttar Pradesh, India

    Munesh C. Trivedi

  3. Department of Computer Science and Engineering, Motilal Nehru National Institute of Technology, Allahabad, Uttar Pradesh, India

    Krishn K. Mishra

  4. Department of Computer Science and Engineering, Motilal Nehru National Institute of Technology, Allahabad, Uttar Pradesh, India

    A. K. Misra

  5. Department of Computer Science and Engineering, University of Mauritius, Moka, Mauritius

    Khedo Kavi Kumar

Rights and permissions

Reprints and permissions

Copyright information

© 2019 Springer Nature Singapore Pte Ltd.

About this paper

Check for updates. Verify currency and authenticity via CrossMark

Cite this paper

Somkunwar, R., Vaze, V.M. (2019). Parallel Approach for Sub-graph Isomorphism on Multicore System Using OpenMP. In: Tiwari, S., Trivedi, M., Mishra, K., Misra, A., Kumar, K. (eds) Smart Innovations in Communication and Computational Sciences. Advances in Intelligent Systems and Computing, vol 851. Springer, Singapore. https://doi.org/10.1007/978-981-13-2414-7_23

Download citation

Publish with us

Policies and ethics

Search

Navigation