Skip to main content
SpringerLink
Log in
Book cover

Proceedings of the 5th International Conference on Frontiers in Intelligent Computing: Theory and Applications pp 241–249Cite as

Graph Partitioning Methods

  • Conference paper
  • First Online:

  • 1169 Accesses

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

Abstract

The analysis of large graph plays a prominent role in various fields of research and application area. Initially, we formally define the partitioning scheme based on user needs and requirements. In this paper, we will be dealing with various methods of graph partitioning, its advantages and disadvantages, and from the result we can conclude which is the most effective method of graph partitioning. We can apply the best method in road navigation, stock market, database modeling, and bioinformatics.

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   169.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   219.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. Vasilis Spyropoulos and Yannis Kotidis, “Dynamic Partitioning of Big Hierarchical Graph”, IEEE Trans. On First International Workshop on Big Dynamic Distributed Data (DB3), Riva Del Grada, Italy, August 30, 2013.

    Google Scholar 

  2. G. A. Ezhilarasi, K. S. Swarup, “Network Decomposition using Kernighan Lin strategy aided harmony search algorithm”, Department of Electrical Engineering, Indian Institute of Technology Madras, Chennai, India.

    Google Scholar 

  3. Andrew E. Caldwell, Andrew B. Kahng, and Igor. L. Markov, “Design and Implementation of Fiduccia Mattheyses Heuristic for VLSI Netlist Partitioning”, UCLA Computer Science Dept., Los Angeles, CA 90095–1596.

    Google Scholar 

  4. Zoltan Baruch, Octavian Cret, Kalman Pusztai, “Comparative Study of Circuit Partitioning Algorithm”, MicroCAD 2000 International Computer Science Conference, Section F: Electrotechnics-Electronics, February-23–24, 2000, Miskole, Hungary.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Padre Conceicao College of Engineering, Verna, Goa, India

    Prabhu Dessai Tanvi, Rodrigues Okstynn & Fernandes Sonia

Authors
  1. Prabhu Dessai Tanvi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Rodrigues Okstynn
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Fernandes Sonia
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Prabhu Dessai Tanvi .

Editor information

Editors and Affiliations

  1. ANITS, Prof., Comp. Sci. & Engg. Dept. ANITS, Visakhapatnam, Andhra Pradesh, India

    Suresh Chandra Satapathy

  2. Dept. of ECE, Shri Ramswaroop Mem. Group of Prof. Clg Dept. of ECE, Lucknow, Uttar Pradesh, India

    Vikrant Bhateja

  3. SCIS, University of Hyderabad , Hyderabad, India

    Siba K. Udgata

  4. KIIT University, School of Computer Engineering KIIT University, Bhubaneswar, Odisha, India

    Prasant Kumar Pattnaik

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer Nature Singapore Pte Ltd.

About this paper

Cite this paper

Tanvi, P.D., Okstynn, R., Sonia, F. (2017). Graph Partitioning Methods. In: Satapathy, S., Bhateja, V., Udgata, S., Pattnaik, P. (eds) Proceedings of the 5th International Conference on Frontiers in Intelligent Computing: Theory and Applications . Advances in Intelligent Systems and Computing, vol 515. Springer, Singapore. https://doi.org/10.1007/978-981-10-3153-3_24

Download citation

  • DOI: https://doi.org/10.1007/978-981-10-3153-3_24

  • Published:

  • Publisher Name: Springer, Singapore

  • Print ISBN: 978-981-10-3152-6

  • Online ISBN: 978-981-10-3153-3

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation