Approximating Shortest Connected Graph Transformation for Trees - Archive ouverte HAL Accéder directement au contenu
Chapitre D'ouvrage Année : 2020

Approximating Shortest Connected Graph Transformation for Trees

Nicolas Bousquet
Alice Joffard

Résumé

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.

Dates et versions

hal-02935477 , version 1 (10-09-2020)

Identifiants

Citer

Nicolas Bousquet, Alice Joffard. Approximating Shortest Connected Graph Transformation for Trees. SOFSEM 2020: SOFSEM 2020: Theory and Practice of Computer Science, pp.76-87, 2020, ⟨10.1007/978-3-030-38919-2_7⟩. ⟨hal-02935477⟩
40 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More