%0 Conference Proceedings
%T Gomory Hu Tree and Pendant Pairs of a Symmetric Submodular System
%+ Shahed University [Téhéran]
%A Hanifehnezhad, Saeid
%A Dolati, Ardeshir
%Z Part 2: Algorithms and Complexity
%< avec comité de lecture
%( Lecture Notes in Computer Science
%B 2nd International Conference on Topics in Theoretical Computer Science (TTCS)
%C Tehran, Iran
%Y Mohammad Reza Mousavi
%Y Jiří Sgall
%I Springer International Publishing
%3 Topics in Theoretical Computer Science
%V LNCS-10608
%P 26-33
%8 2017-09-12
%D 2017
%R 10.1007/978-3-319-68953-1_3
%K Symmetric submodular system
%K Contraction of a system
%K Pendant pair
%K Maximum adjacency ordering
%K Gomory-Hu tree
%Z Computer Science [cs]Conference papers
%X 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}$.
%G English
%Z TC 1
%Z WG 1.8
%2 https://inria.hal.science/hal-01760643/document
%2 https://inria.hal.science/hal-01760643/file/440117_1_En_3_Chapter.pdf
%L hal-01760643
%U https://inria.hal.science/hal-01760643
%~ IFIP-LNCS
%~ IFIP
%~ IFIP-TC
%~ IFIP-TC1
%~ IFIP-WG1-8
%~ IFIP-TTCS
%~ IFIP-LNCS-10608