Connectivity Mathematics Computer Science (4 results)
- Hardcover
Seller: Ria Christie Collections, Uxbridge, United KingdomRia Christie Collections
Contact seller5-star sellerCondition: New
£ 134.51
£ 14.94 shippingShips from United Kingdom to U.S.A.Quantity: 2 available
Condition: New. In English.
- Hardcover
Seller: Kennys Bookstore, Olney, MD, U.S.A.Kennys Bookstore
Contact seller5-star sellerCondition: New
£ 151.59
£ 7.80 shippingShips within U.S.A.Quantity: 1 available
Condition: 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.…
- Hardcover
Seller: Kennys Bookshop and Art Galleries Ltd., Galway, GY, IrelandKennys Bookshop and Art Galleries Ltd.
Contact seller5-star sellerCondition: New
£ 174.79
£ 7.93 shippingShips from Ireland to U.S.A.Quantity: 1 available
Condition: 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. . . . .…
- Softcover
- Print on Demand
Seller: AHA-BUCH GmbH, Einbeck, GermanyAHA-BUCH GmbH
Contact seller5-star sellerCondition: New
£ 105.87
£ 29.21 shippingShips from Germany to U.S.A.Quantity: 1 available
Taschenbuch. Condition: 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.…
