Approximating Shortest Connected Graph Transformation for Trees

Nicolas Bousquet 1 Alice Joffard 2
1 G-SCOP_OC - OC
G-SCOP - Laboratoire des sciences pour la conception, l'optimisation et la production
2 GOAL - Graphes, AlgOrithmes et AppLications
LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information
Abstract : Let G, H 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 uv, xy of G by ux and vy. Taylor showed that there always exists a sequence of flips that transforms G into H maintaining connec-tivity. 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.
Document type :
Preprints, Working Papers, ...
Complete list of metadatas

Cited literature [14 references]  Display  Hide  Download

https://hal.archives-ouvertes.fr/hal-02358489
Contributor : Alice Joffard <>
Submitted on : Wednesday, December 18, 2019 - 2:50:42 PM
Last modification on : Tuesday, January 14, 2020 - 12:33:17 PM

Identifiers

  • HAL Id : hal-02358489, version 1

Citation

Nicolas Bousquet, Alice Joffard. Approximating Shortest Connected Graph Transformation for Trees. 2019. ⟨hal-02358489⟩

Share

Metrics

Record views

14

Files downloads

28