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.
Author supplied keywords
Cite
CITATION STYLE
Tanvi, P. D., Okstynn, R., & Sonia, F. (2017). Graph partitioning methods. In Advances in Intelligent Systems and Computing (Vol. 515, pp. 241–249). Springer Verlag. https://doi.org/10.1007/978-981-10-3153-3_24
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
