A new spanning tree algorithm
| dc.contributor.author | Wasson, W., D. | |
| dc.contributor.author | McIssaac, Robert | |
| dc.date.accessioned | 2023-03-01T18:29:59Z | |
| dc.date.available | 2023-03-01T18:29:59Z | |
| dc.date.issued | 1974 | |
| dc.description.abstract | The algorithm outlined in this paper finds all the spanning trees of a non-directed graph G. The graph is represented by a binary incidence matrix using compact bit storage. Each row of the matrix corresponds to a branch of the graph and is represented by one or more computer words. Each column of the matrix corresponds to a graph node and is represented by a single bit within each computer word or multiple word. It is shown, in addition to saving computer storage, that this representation greatly speeds up the tree generation process by allowing many bit-parallel operations to occur during the execution of a single computer instruction cycle. | |
| dc.description.copyright | Copyright @ W. Dana Wasson and Robert McIssaac, 1974. | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/14963 | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | A new spanning tree algorithm | |
| dc.type | technical report |
Files
Original bundle
1 - 1 of 1