Compression methods for graph algorithms
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...
| Main Author: | |
|---|---|
| Language: | en |
| Published: |
University of Canterbury. Computer Science
2014
|
| Online Access: | http://hdl.handle.net/10092/9568 |