Triangle counting and listing in directed and undirected graphs using single machines
Triangle enumeration is an important element in graph analysis, and because of this it is a topic that has been studied extensively. Although the formulation is simple, for large networks the computation becomes challenging as we have to deal with memory limitation and efficiency. Many algorithms ha...
Main Author: | |
---|---|
Other Authors: | |
Format: | Others |
Language: | English en |
Published: |
2018
|
Subjects: | |
Online Access: | https://dspace.library.uvic.ca//handle/1828/9902 |