عنوان
پدید آورنده
موضوع
رده
کتابخانه
محل استقرار
NATIONAL BIBLIOGRAPHY NUMBER
Number
TLpq2507962577
LANGUAGE OF THE ITEM
.Language of Text, Soundtrack etc
انگلیسی
TITLE AND STATEMENT OF RESPONSIBILITY
Title Proper
Comparative Study of Graph Clustering Algorithms
General Material Designation
[Thesis]
First Statement of Responsibility
Shah, Nishita Divyakant
Subsequent Statement of Responsibility
Khan, Maleq
.PUBLICATION, DISTRIBUTION, ETC
Name of Publisher, Distributor, etc.
Texas A&M University - Kingsville
Date of Publication, Distribution, etc.
2019
PHYSICAL DESCRIPTION
Specific Material Designation and Extent of Item
35
DISSERTATION (THESIS) NOTE
Dissertation or thesis details and type of degree
M.S.
Body granting the degree
Texas A&M University - Kingsville
Text preceding or following the note
2019
SUMMARY OR ABSTRACT
Text of Note
Basic idea of graph clustering is finding sets of "related" vertices in graphs. Graph clustering has many important applications in computing such as market research, pattern recognition, data analysis, image processing, etc., but due to growing sizes of graphs, even traditionally fast clustering methods can be computationally expensive for real-world graphs. As a first step towards understanding the graph clustering approach, we studied existing algorithms and explored new ideas in the world of graph clustering. We have implemented our algorithm parallelly. We have checked the efficiency and scalability of parallel algorithm on a modern MPI machine to work with large graphs and found that parallel algorithms give more runtime speedup than sequential algorithm.
TOPICAL NAME USED AS SUBJECT
Computer science
PERSONAL NAME - PRIMARY RESPONSIBILITY
Khan, Maleq
Shah, Nishita Divyakant
ELECTRONIC LOCATION AND ACCESS
Electronic name
مطالعه متن کتاب p
[Thesis]
276903
a
Y
