Connectivity mathematics computer science (4 Ergebnisse)

Zustand: New. In English.

Zustand: New. Connectivity and facilities location are two important topics in network design, with applications in data communication, transportation, production planning, and VLSI designs. This volume features talks presented at an interdisciplinary research workshop held at DIMACS in April 1997. Editor(s): Pardalos, Panos M.; Du, Ding-Zhu. Series: Series in Discrete Mathematics & Theoretical Computer Science. Num Pages: 461 pages. BIC Classification: PBW; UYA. Category: (P) Professional & Vocational. Dimension: 230. Weight in Grams: 1045. . 1998. Hardcover. . . . . Books ship from the US and Ireland. …

Zustand: New. Connectivity and facilities location are two important topics in network design, with applications in data communication, transportation, production planning, and VLSI designs. This volume features talks presented at an interdisciplinary research workshop held at DIMACS in April 1997. Editor(s): Pardalos, Panos M.; Du, Ding-Zhu. Series: Series in Discrete Mathematics & Theoretical Computer Science. Num Pages: 461 pages. BIC Classification: PBW; UYA. Category: (P) Professional & Vocational. Dimension: 230. Weight in Grams: 1045. . 1998. Hardcover. . . . . …

Taschenbuch. Zustand: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - Please note that the content of this book primarily consists of articlesavailable from Wikipedia or other free sources online. In mathematicsand computer science, connectivity is one of the basic concepts of graphtheory. It is closely related to the theory of network flow problems.The connectivity of a graph is an important measure of its robustness asa network.In an undirected graph G, two vertices u and v are calledconnected if G contains a path from u to v. Otherwise, they are calleddisconnected. If the two vertices are additionally connected by a pathof length 1, i.e. by a single edge, the vertices are called adjacent. Agraph is said to be connected if every pair of vertices in the graph areconnected.…