Compression methods for graph algorithms
| dc.contributor.author | Freeth, S. A. | en |
| dc.date.accessioned | 2014-08-31T19:54:52Z | |
| dc.date.available | 2014-08-31T19:54:52Z | |
| dc.date.issued | 1985 | en |
| dc.description.abstract | Two compression methods for representing graphs are presented, in conjunction with algorithms applying these methods. A decomposition technique for networks that can be generated in O(m) time is presented. The components of the decomposition and the shortest path matrix of the compressed network can be used to find the shortest path between any pair of vertices in the original network in linear time. A compression method for boolean matrices and a method for applying the compression to boolean matrix multiplication is developed. The algorithms have an expected running time of O(n²*log ₂n). From this compression method a simple heuristic that may be applied to any algorithm for boolean matrix multiplication has been developed. This heuristic will improve the average running time of boolean matrix multiplication algorithms. An order of magnitude analysis of the results published by Loukakis and Tsouris [1981], on the efficiency of algorithms for finding all maximal independent sets of a graph has been performed. This analysis showed that their conclusions, which are based on a direct comparison of the running times of the algorithms, do not take into account implementation factors. An average constant factor improvement is developed for the algorithm of Tsukiyama, Ide, Ariyoshi and Shirakawa [1977] for finding all maximal independent sets of a graph. Analysis of the running time results from the algorithm comparisons presented in this thesis show that the Bron-Kerbosch algorithm has the smallest rate of increase in running time as the size of the graphs increase. | en |
| dc.identifier.uri | http://hdl.handle.net/10092/9568 | |
| dc.identifier.uri | http://dx.doi.org/10.26021/3214 | |
| dc.language.iso | en | |
| dc.publisher | University of Canterbury. Computer Science | en |
| dc.relation.isreferencedby | NZCU | en |
| dc.rights | Copyright S. A. Freeth | en |
| dc.rights.uri | https://canterbury.libguides.com/rights/theses | en |
| dc.title | Compression methods for graph algorithms | en |
| dc.type | Theses / Dissertations | |
| thesis.degree.discipline | Computer Science | |
| thesis.degree.grantor | University of Canterbury | en |
| thesis.degree.level | Doctoral | en |
| thesis.degree.name | Doctor of Philosophy | en |
| uc.bibnumber | 2074988 | |
| uc.college | Faculty of Engineering | en |
Files
Original bundle
1 - 1 of 1