Steiner Tree Problem: Jakob Steiner, Combinatorial Optimization, Minimum spanning Tree, Tree (graph theory), Electrical Network, Network Planning and Design - Couverture souple

 
9786130333881: Steiner Tree Problem: Jakob Steiner, Combinatorial Optimization, Minimum spanning Tree, Tree (graph theory), Electrical Network, Network Planning and Design
Couverture souple
ISBN 10 : 6130333889 ISBN 13 : 9786130333881
Editeur : Betascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. The Steiner tree problem is superficially similar to the minimum spanning tree problem: given a set V of points (vertices), interconnect them by a network (graph) of shortest length, where the length is the sum of the lengths of all edges. The difference between the Steiner tree problem and the minimum spanning tree problem is that, in the Steiner tree problem, extra intermediate vertices and edges may be added to the graph in order to reduce the length of the spanning tree. These new vertices introduced to decrease the total length of connection are known as Steiner points or Steiner vertices. It has been proved that the resulting connection is a tree, known as the Steiner tree. There may be several Steiner trees for a given set of initial vertices.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Éditeur
Betascript Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
6130333889
ISBN 13 
9786130333881
Reliure
Broché
Nombre de pages
132
Éditeur
Surhone Lambert M., Timpledon Miriam T., Marseken Susan F.
Coordonnées du fabricant
non disponible
Personne responsable
non disponible