Advertisement

Approximating Shortest Connected Graph Transformation for Trees

  • Nicolas Bousquet
  • Alice JoffardEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 12011)

Abstract

Let GH be two connected graphs with the same degree sequence. The aim of this paper is to find a transformation from G to H via a sequence of flips maintaining connectivity. A flip of G is an operation consisting in replacing two existing edges uvxy of G by ux and vy.

Taylor showed that there always exists a sequence of flips that transforms G into H maintaining connectivity. Bousquet and Mary proved that there exists a 4-approximation algorithm of a shortest transformation. In this paper, we show that there exists a 2.5-approximation algorithm running in polynomial time. We also discuss the tightness of the lower bound and show that, in order to drastically improve the approximation ratio, we need to improve the best known lower bounds.

References

  1. 1.
    Bereg, S., Ito, H.: Transforming graphs with the same graphic sequence. J. Inf. Process. 25, 627–633 (2017)Google Scholar
  2. 2.
    Berman, P., Hannenhalli, S., Karpinski, M.: 1.375-approximation algorithm for sorting by reversals. In: Möhring, R., Raman, R. (eds.) ESA 2002. LNCS, vol. 2461, pp. 200–210. Springer, Heidelberg (2002).  https://doi.org/10.1007/3-540-45749-6_21CrossRefGoogle Scholar
  3. 3.
    Bousquet, N., Mary, A.: Reconfiguration of graphs with connectivity constraints. In: Epstein, L., Erlebach, T. (eds.) WAOA 2018. LNCS, vol. 11312, pp. 295–309. Springer, Cham (2018).  https://doi.org/10.1007/978-3-030-04693-4_18CrossRefGoogle Scholar
  4. 4.
    Caprara, A.: Sorting by reversals is difficult. In: Proceedings of the First Annual International Conference on Computational Molecular Biology, RECOMB 1997, pp. 75–83. ACM (1997)Google Scholar
  5. 5.
    Christie, D.A.: A 3/2-approximation algorithm for sorting by reversals. In: Proceedings of the Ninth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1998, pp. 244–252 (1998)Google Scholar
  6. 6.
    Diestel, R.: Graph Theory. Graduate Texts in Mathematics, vol. 173, 3rd edn. Springer, Heidelberg (2005).  https://doi.org/10.1007/978-3-662-53622-3CrossRefzbMATHGoogle Scholar
  7. 7.
    Hakimi, S.L.: On realizability of a set of integers as degrees of the vertices of a linear graph. i. J. Soc. Ind. Appl. Math. 10(3), 496–506 (1962)MathSciNetCrossRefGoogle Scholar
  8. 8.
    Hakimi, S.L.: On realizability of a set of integers as degrees of the vertices of a linear graph ii. Uniqueness. J. Soc. Ind. Appl. Math. 11(1), 135–147 (1963)MathSciNetCrossRefGoogle Scholar
  9. 9.
    Hannenhalli, S., Pevzner, P.A.: Transforming cabbage into turnip: polynomial algorithm for sorting signed permutations by reversals. J. ACM (JACM) 46(1), 1–27 (1999)MathSciNetCrossRefGoogle Scholar
  10. 10.
    Kececioglu, J.D., Sankoff, D.: Exact and approximation algorithms for sorting by reversals, with application to genome rearrangement. Algorithmica 13(1/2), 180–210 (1995)MathSciNetCrossRefGoogle Scholar
  11. 11.
    Nishimura, N.: Introduction to reconfiguration (2017, preprint)Google Scholar
  12. 12.
    Senior, J.: Partitions and their representative graphs. Am. J. Math. 73(3), 663–689 (1951)MathSciNetCrossRefGoogle Scholar
  13. 13.
    Taylor, R.: Contrained switchings in graphs. In: McAvaney, K.L. (ed.) Combinatorial Mathematics VIII. LNM, vol. 884, pp. 314–336. Springer, Heidelberg (1981).  https://doi.org/10.1007/BFb0091828CrossRefGoogle Scholar
  14. 14.
    Will, T.G.: Switching distance between graphs with the same degrees. SIAM J. Discrete Math. 12(3), 298–306 (1999)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  1. 1.Univ. Grenoble Alpes, CNRS, Laboratoire G-SCOP, Grenoble-INPGrenobleFrance
  2. 2.LIRIS, Université Claude BernardLyonFrance

Personalised recommendations