Arbre de Steiner

Ci-dessus, fig. 3.10 : "Graph with nodes [less than] 400" (p.41)

"Steiner tree problem [1] is one of the most important and complicated topics of graph theory and it is a minimum interconnection problem. It is also known as one of the possible solutions of multicast routing and the wire routing phase in physical VLSI design to minimize certain estimates of electrical delay." (p. 3)

Visualization of the Steiner Tree Heuristic solutions with LEDA, University of Cincinnati, Myung C. Ko, 2002