Connectivity (Graph Theory): Mathematics, Computer science, Graph theory, Flow network, Undirected graph, Connected component (graph theory). - Couverture souple

 
9786132848697: Connectivity (Graph Theory): Mathematics, Computer science, Graph theory, Flow network, Undirected graph, Connected component (graph theory).
Couverture souple
ISBN 10 : 613284869X ISBN 13 : 9786132848697
Editeur : Alphascript Publishing, 2010

Synopsis

Please note that the content of this book primarily consists of articles available from Wikipedia or other free sources online. In mathematics and computer science, connectivity is one of the basic concepts of graph theory. It is closely related to the theory of network flow problems. The connectivity of a graph is an important measure of its robustness as a network.In an undirected graph G, two vertices u and v are called connected if G contains a path from u to v. Otherwise, they are called disconnected. If the two vertices are additionally connected by a path of length 1, i.e. by a single edge, the vertices are called adjacent. A graph is said to be connected if every pair of vertices in the graph are connected.

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

Éditeur
Alphascript Publishing
Date d'édition
2010
Langue
anglais
ISBN 10 
613284869X
ISBN 13 
9786132848697
Reliure
Broché
Nombre de pages
72
Éditeur
Miller Frederic P., Vandome Agnes F., McBrewster John
Coordonnées du fabricant
non disponible
Personne responsable
non disponible