Graph decomposition algorithms for analyzing social and large complex networks

Simple item page
dc.contributor.authorAbdullah, Wali Mohammad
dc.contributor.authorUniversity of Lethbridge. Faculty of Arts and Science
dc.contributor.supervisorHossain, Shahadat
dc.date.accessioned2022-08-04T18:51:35Z
dc.date.available2022-08-04T18:51:35Z
dc.date.issued2022
dc.degree.levelPh.Den_US
dc.description.abstractGraphs are often used to model or represent large and sparse networks with billions of vertices and edges and store extensive amounts of structural and semantic information. Therefore, analyzing characteristics in networked data, such as graphs that can yield important information on the modelled structure, is challenging due to their linked nature and size. A common way to uncover this high-quality information is by analyzing subgraphs to get a deeper understanding of the data, which are helpful for classification, clustering, and knowledge discovery. This thesis proposes using a compact network data representation based on sparse matrix data structures. We will consider the enumeration of subgraphs (edge clique cover problem) with some ordering schemes. Finally, we benefit from the linear algebraic approach to graph algorithms for counting triangles, triangle enumeration, the k-count algorithm, and triangle centrality calculation. This thesis will present both serial and parallel algorithms for solving these problems.en_US
dc.identifier.urihttps://hdl.handle.net/10133/6302
dc.language.isoenen_US
dc.proquest.subject0984en_US
dc.proquest.subject0796en_US
dc.proquest.subject0537en_US
dc.proquestyesYesen_US
dc.publisherLethbridge, Alta. : University of Lethbridge, Dept. of Mathematics and Computer Scienceen_US
dc.publisher.departmentDepartment of Mathematics and Computer Scienceen_US
dc.publisher.facultyArts and Scienceen_US
dc.relation.ispartofseriesThesis (University of Lethbridge. Faculty of Arts and Science)en_US
dc.subjectGraph decomposition algorithmsen_US
dc.subjectClique coveren_US
dc.subjectTriangle count and enumerationen_US
dc.subjectIntersection matrixen_US
dc.subjectSparse graphen_US
dc.subjectParallel algorithmsen_US
dc.subject.lcshDissertations, Academic
dc.titleGraph decomposition algorithms for analyzing social and large complex networksen_US
dc.typeThesisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
ABDULLAH_WALI_PHD_2022.pdf
Size:
3.49 MB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
license.txt
Size:
3.25 KB
Format:
Item-specific license agreed upon to submission
Description:
Download
Collections
Arts and Science, Faculty of
University of Lethbridge Theses