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

This publication has 10 references indexed in Scilit:

• Algorithms for Generating Fundamental Cycles in a Graph
  ACM Transactions on Mathematical Software, 1982
• An Efficient Cycle Vector Space Algorithm for Listing All Cycles of a Planar Graph
  SIAM Journal on Computing, 1981
• Minimum-length fundamental cycle set
  IEEE Transactions on Circuits and Systems, 1979
• On cycle bases of a graph
  Networks, 1979
• On Algorithms for Enumerating All Circuits of a Graph
  SIAM Journal on Computing, 1976
• An algorithm for the longest cycle problem
  Networks, 1976
• On optimally sparse cycle and coboundary basis for a linear graph
  IEEE Transactions on Circuit Theory, 1973
• An algorithm for finding a fundamental set of cycles of a graph
  Communications of the ACM, 1969
• Algorithm 97: Shortest path
  Communications of the ACM, 1962
• A note on two problems in connexion with graphs
  Numerische Mathematik, 1959