Gomory Hu Tree and Pendant Pairs of a Symmetric Submodular System - Inria - Institut national de recherche en sciences et technologies du numérique
Communication Dans Un Congrès Année : 2017

Gomory Hu Tree and Pendant Pairs of a Symmetric Submodular System

Saeid Hanifehnezhad
  • Fonction : Auteur
  • PersonId : 1030365
Ardeshir Dolati
  • Fonction : Auteur
  • PersonId : 1030363

Résumé

Let $\mathcal {S}=(V, f),$ be a symmetric submodular system. For two distinct elements s and l of V,  let $\varGamma (s, l)$ denote the set of all subsets of V which separate s from l. By using every Gomory Hu tree of $\mathcal {S}$ we can obtain an element of $\varGamma (s, l)$ which has minimum value among all the elements of $\varGamma (s, l).$ This tree can be constructed iteratively by solving $|V|-1$ minimum sl-separator problem. An ordered pair (s, l) is called a pendant pair of $\mathcal {S}$ if $\{l\}$ is a minimum sl-separator. Pendant pairs of a symmetric submodular system play a key role in finding a minimizer of this system. In this paper, we obtain a Gomory Hu tree of a contraction of $\mathcal {S}$ with respect to some subsets of V only by using contraction in Gomory Hu tree of $\mathcal {S}.$ Furthermore, we obtain some pendant pairs of $\mathcal {S}$ and its contractions by using a Gomory Hu tree of $\mathcal {S}$.
Fichier principal
Vignette du fichier
440117_1_En_3_Chapter.pdf (264.97 Ko) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Loading...

Dates et versions

hal-01760643 , version 1 (06-04-2018)

Licence

Identifiants

Citer

Saeid Hanifehnezhad, Ardeshir Dolati. Gomory Hu Tree and Pendant Pairs of a Symmetric Submodular System. 2nd International Conference on Topics in Theoretical Computer Science (TTCS), Sep 2017, Tehran, Iran. pp.26-33, ⟨10.1007/978-3-319-68953-1_3⟩. ⟨hal-01760643⟩
247 Consultations
147 Téléchargements

Altmetric

Partager

More