Computing (1+ϵ)-Approximate Degeneracy in Sublinear Time

Simple item page
dc.contributor.authorYong, Quinton
dc.contributor.supervisorKing, Valerie
dc.contributor.supervisorThomo, Alex
dc.date.accessioned2022-12-21T19:07:21Z
dc.date.available2022-12-21T19:07:21Z
dc.date.copyright2022en_US
dc.date.issued2022-12-21
dc.degree.departmentDepartment of Computer Science
dc.degree.levelMaster of Science M.Sc.en_US
dc.description.abstractThe problem of finding the degeneracy of a graph is a subproblem of the k-core decomposition problem. In this paper, we present a (1 + ϵ)-approximate solution to the degeneracy problem which runs in O(n log n) time on a graph with n nodes, sublinear in the input size for dense graphs, by sampling a small number of neighbours adjacent to high degree nodes. Our algorithm can also be extended to an O(n log n) time solution to the k-core decomposition problem. This improves upon the method by Bhattacharya et al., which implies a (4 + ϵ)-approximate ˜O(n) solution to the degeneracy problem. Our techniques are similar to other sketching methods which use sublinear space for k-core and degeneracy. We prove theoretical guarantees of our algorithm and provide optimizations which improve the running time of our algorithm in practice. Experiments on massive real-world web graphs show that our algorithm performs significantly faster than previous methods for computing degeneracy, including the 2022 exact degeneracy algorithm by Li et al.en_US
dc.description.scholarlevelGraduateen_US
dc.identifier.urihttp://hdl.handle.net/1828/14576
dc.languageEnglisheng
dc.language.isoenen_US
dc.rightsAvailable to the World Wide Weben_US
dc.subjectGraphsen_US
dc.subjectk-coreen_US
dc.subjectDegeneracyen_US
dc.subjectSublinearen_US
dc.subjectApproximateen_US
dc.subjectRandomized Algorithmen_US
dc.titleComputing (1+ϵ)-Approximate Degeneracy in Sublinear Timeen_US
dc.typeThesisen_US

Files

Original bundle
Now showing 1 - 1 of 1
Thumbnail Image
Name:
Yong_Quinton_MSc_2022.pdf
Size:
522.58 KB
Format:
Adobe Portable Document Format
Description:
Download
License bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
license.txt
Size:
2 KB
Format:
Item-specific license agreed upon to submission
Description:
Download

Collections

Electronic Theses and Dissertations (ETD)
 
University of Victoria Libraries

We acknowledge and respect the Lək̓ʷəŋən (Songhees and Esquimalt) Peoples on whose territory the university stands, and the Lək̓ʷəŋən and W̱SÁNEĆ Peoples whose historical relationships with the land continue to this day.