A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph

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 3 a basis with the shortest length in 0(e v) operations. Edges may be weighted or unweighted. A POLYNOMIAL-TIME ALGORITHM TO FIND THE SHORTEST CYCLE BASIS OF A GRAPH

DOI: 10.1137/0216026

Extracted Key Phrases

1 Figure or Table

01020'92'95'98'01'04'07'10'13'16
Citations per Year

191 Citations

Semantic Scholar estimates that this publication has 191 citations based on the available data.

See our FAQ for additional information.

Cite this paper

@article{Horton1987APA, title={A Polynomial-Time Algorithm to Find the Shortest Cycle Basis of a Graph}, author={Joseph Douglas Horton}, journal={SIAM J. Comput.}, year={1987}, volume={16}, pages={358-366} }