14:00
15:00

[gt.go] - "Steiner Tree Packing Problem" by Yaping Mao

/Exposé en anglais/Talk in english/

Steiner tree is popularly used in the physical design of VLSI circuits and network science. Steiner tree is also used in computer communication networks and optical wireless communication networks. For a given graph G and a vertex subset S, the problem that asks to find a set of maximum number of edge-disjoint Steiner trees connecting S of G is called the Steiner tree packing problem, which studies local properties of graphs or networks. Generalized (edge-)connectivity is an Steiner tree packing parameter, which focuses on global properties of graphs or networks.

In this talk, we present the computational complexity and some known results of generalized connectivity. We also introduce recent progress of Kriesell Conjecture on Steiner tree packing problem and West-Wu Conjecture on S-connectors.

[Yaping Mao] (Qinghai Normal University )

https://math.qhnu.edu.cn/info/1157/1593.htm

Remarks / Remarques

Find all the information of the working group on this [ https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT?userlang=en | web page ] .
Retrouvez toutes les informations du GT sur cette [ https://graphesetoptimisation.labri.fr/pmwiki.php/Groupe/GT | page web ] .

LaBRI/178 and https://webconf.math.cnrs.fr/b/mar-zjd-6dz