Graphs and Combinatorics

, Volume 32, Issue 1, pp 65–77 | Cite as

Finding Shorter Cycles in a Weighted Graph

Original Paper

Abstract

In this paper we investigate the structures of short cycles in a weighted graph. By Thomassen’s \(3\)-path-condition theory (Thomassen in J Comb Theory Ser 48:155–177, 1990), it is easy to find a shortest cycle in a collection of cycles beyond a subspace of the cycle space of a graph. What is more difficult for one to do is to find a shortest cycle within a subspace of the cycle space in polynomial time. By using the Dijkstra’s algorithm (Dijkstra in Numer Math 1:55–61, 1959) we find a collection \(\mathcal {C}\) of cycles containing many types of short cycles within a given subspace of the cycle space of a graph and this implies a polynomial time algorithm (called extended fundamental cycle algorithm) to locate all the possible shortest cycles in a weighted graph. In the case of unweighted graphs, the algorithm may also find every shortest even cycle in a graph, this greatly improved a result of Grötschel and Pulleyblank (Oper Res Lett 1:23–27, 1981/82), Monien (Computing 31:355–369, 1983), Yuster and Zwick (SIAM J Discrete Math 10:209–222, 1997). In fact, our algorithm shows that there are at most \(O(n^4)\) many such short cycles in an unweighted graph of order \(n\). Further more, our fundamental cycle method may find a minimum cycle base (or simply MCB as some scholars named) in the cycle space of a graph. Since the structure of MCB’s is unique (Ren and Deng in Discrete Math 307:2654–2660, 2007), this shows that, in the sense, cycles in a MCB are nearly-fundamental (i.e., each element in a MCB is a sum of at most two fundamental cycles). This provides a new way to study MCB.

Keywords

Fundamental cycle Dijkstra’s algorithm \(3\)-Path-condition 

References

  1. 1.
    Bondy, J.A., Murty, U.S.R.: Graph Theory. Springer, Berlin (2008)MATHCrossRefGoogle Scholar
  2. 2.
    Dijkstra, E.W.: A note on two problems in connection with graphs. Numer. Math. 1, 55–61 (1959)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Grötschel, M., Pulleyblank, W.R.: Weakly bipartite graphs and the max-cut problem. Oper. Res. Lett., 1, 23–27 (1981/82)Google Scholar
  4. 4.
    Halford, T.R., Chugg, K.M.: An algorithm for counting short cycles in bipartite graphs. IEEE Trans. Inf. Theory 52, 287–292 (2006)MATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Horton, J.D.: A polynomial-time algorithm to find the shortest cycle base of a graph. SIAM J. Comput. 16, 356–366 (1987)MathSciNetCrossRefGoogle Scholar
  6. 6.
    Leydold, J., Stadler, P.F.: Minimum cycle bases of outer planar graphs. Electronic J. Comb. 5, R16 (1998)MathSciNetGoogle Scholar
  7. 7.
    Mackay, D.J.C., Neal, R.M.: Near Shannon limited performance of low density parity check codes. IEEE Electron. Lett. 32, 1645–1646 (1996)CrossRefGoogle Scholar
  8. 8.
    Mohar, B., Thomassen, C.: Graphs on Surfaces. Johns Hopkins University Press, Baltimore (2001)MATHGoogle Scholar
  9. 9.
    Monien, B.: The complexity of determining a shortest cycle of even length. Computing 31, 355–369 (1983)MATHMathSciNetCrossRefGoogle Scholar
  10. 10.
    Reiman, I.: Über ein Problem von K. Zarankiewicz. Acta Math. Acad. Sci. Hung. 9, 269–273 (1958)MATHMathSciNetCrossRefGoogle Scholar
  11. 11.
    Ren, H., Deng, M.: Minimum cycle bases of graphs on surfaces. Discrete Math. 307, 2654–2660 (2007)MATHMathSciNetCrossRefGoogle Scholar
  12. 12.
    Thomassen, C.: Embeddings of graphs with no short non-contractible cycles. J. Comb. Theory Ser. B 48, 155–177 (1990)MATHMathSciNetCrossRefGoogle Scholar
  13. 13.
    Thomassen, C.: Five-coloring maps on surfaces. J. Comb. Theory Ser. B 59, 89–105 (1993)MATHMathSciNetCrossRefGoogle Scholar
  14. 14.
    Yuster, R., Zwick, U.: Finding even cycles even faster. SIAM J. Discrete Math. 10, 209–222 (1997)MATHMathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Japan 2015

Authors and Affiliations

  1. 1.Department of MathematicsEast China Normal UniversityShanghaiChina

Personalised recommendations