A polynomial-time algorithm to find the shortest cycle basis of a graph
| dc.contributor.author | Horton, J., D. | |
| dc.date.accessioned | 2023-03-01T18:28:38Z | |
| dc.date.available | 2023-03-01T18:28:38Z | |
| dc.date.issued | 1984 | |
| dc.description.abstract | Define the length of a basis of a cycle space to be the sum of the lengths of all circuits in the basis. An algorithm is given that finds a basis with the shortest length in 0(e[superscript 3]v) operations. Edges may be weighted or unweighted. | |
| dc.description.copyright | Copyright @ J. D. Horton, 1984. | |
| dc.identifier.uri | https://unbscholar.lib.unb.ca/handle/1882/14863 | |
| dc.rights | http://purl.org/coar/access_right/c_abf2 | |
| dc.subject.discipline | Computer Science | |
| dc.title | A polynomial-time algorithm to find the shortest cycle basis of a graph | |
| dc.type | technical report |
Files
Original bundle
1 - 1 of 1