The theory of networks is a very lively one, both in terms of developments in the theory itself and of the variety of its applications. This book, based on the 1981 AMS Short Course on the Mathematics of Networks, introduces most of the basic ideas of network theory and develops some of these ideas considerably. A number of more specialized topics are introduced, including areas of active research and a wide variety of applications. Frank Boesch gives the basic definitions in the mathematics of networks and in the closely-related topic of graph theory. He discusses two of the most fundamental network problems - the shortest path problem and the minimum spanning tree problem as well as some of their variants.Boesch also gives an interesting presentation in the area of network reliability. Frances Yao considers maximum flows in networks, the problem most often thought of in connection with the mathematics of networks. Richard Karp gives an account of the computational complexity of network problems. Using the case study method, Shen Lin demonstrates the effective use of heuristic algorithms in network design. Four applications of the mathematics of networks are presented by Daniel Kleitman. These include: the design of irrigation systems, the theory of electrical networks, the scheduling of delivery trucks, and the physics of ice. Finally, Nicholas Pippenger presents a chapter on telephone switching networks, an area of network theory that leads to difficult mathematics drawn from such apparently unrelated fields as harmonic analysis.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
Vendeur : BookDepart, Shepherdstown, WV, Etats-Unis
Paperback. Etat : Very Good. Trade paperback, light fading, light shelf wear to exterior; very good cond ition with clean text, tight binding. N° de réf. du vendeur 90868
Quantité disponible : 1 disponible(s)
Vendeur : Zubal-Books, Since 1961, Cleveland, OH, Etats-Unis
Etat : Very Good. 142 pp., paperback, previous owner's name to front endpaper else very good. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. N° de réf. du vendeur ZB1346624
Quantité disponible : 1 disponible(s)
Vendeur : Buchpark, Trebbin, Allemagne
Etat : Sehr gut. Zustand: Sehr gut | Sprache: Englisch | Produktart: Bücher | Keine Beschreibung verfügbar. N° de réf. du vendeur 33291246/202
Quantité disponible : 1 disponible(s)
Vendeur : Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlande
Etat : New. The theory of networks is a very lively one, both in terms of developments in the theory itself and of the variety of its applications. This book, based on the 1981 AMS Short Course on the Mathematics of Networks, introduces most of the basic ideas of network theory and develops some of these ideas considerably. Editor(s): Burr, Stefan A. Series: Proceedings of Symposia in Applied Mathematics. Num Pages: 142 pages, Illustrations. BIC Classification: PB. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Weight in Grams: 482. . 1982. Paperback. . . . . N° de réf. du vendeur V9780821800317
Quantité disponible : 1 disponible(s)
Vendeur : Rarewaves.com USA, London, LONDO, Royaume-Uni
Paperback. Etat : New. The theory of networks is a very lively one, both in terms of developments in the theory itself and of the variety of its applications. This book, based on the 1981 AMS Short Course on the Mathematics of Networks, introduces most of the basic ideas of network theory and develops some of these ideas considerably. A number of more specialized topics are introduced, including areas of active research and a wide variety of applications. Frank Boesch gives the basic definitions in the mathematics of networks and in the closely-related topic of graph theory. He discusses two of the most fundamental network problems - the shortest path problem and the minimum spanning tree problem as well as some of their variants.Boesch also gives an interesting presentation in the area of network reliability. Frances Yao considers maximum flows in networks, the problem most often thought of in connection with the mathematics of networks. Richard Karp gives an account of the computational complexity of network problems. Using the case study method, Shen Lin demonstrates the effective use of heuristic algorithms in network design. Four applications of the mathematics of networks are presented by Daniel Kleitman. These include: the design of irrigation systems, the theory of electrical networks, the scheduling of delivery trucks, and the physics of ice. Finally, Nicholas Pippenger presents a chapter on telephone switching networks, an area of network theory that leads to difficult mathematics drawn from such apparently unrelated fields as harmonic analysis. N° de réf. du vendeur LU-9780821800317
Quantité disponible : 1 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 142 pages. 10.00x6.75x0.25 inches. In Stock. N° de réf. du vendeur __0821800310
Quantité disponible : 2 disponible(s)
Vendeur : Kennys Bookstore, Olney, MD, Etats-Unis
Etat : New. The theory of networks is a very lively one, both in terms of developments in the theory itself and of the variety of its applications. This book, based on the 1981 AMS Short Course on the Mathematics of Networks, introduces most of the basic ideas of network theory and develops some of these ideas considerably. Editor(s): Burr, Stefan A. Series: Proceedings of Symposia in Applied Mathematics. Num Pages: 142 pages, Illustrations. BIC Classification: PB. Category: (P) Professional & Vocational; (UP) Postgraduate, Research & Scholarly. Weight in Grams: 482. . 1982. Paperback. . . . . Books ship from the US and Ireland. N° de réf. du vendeur V9780821800317
Quantité disponible : 1 disponible(s)
Vendeur : Rarewaves.com UK, London, Royaume-Uni
Paperback. Etat : New. The theory of networks is a very lively one, both in terms of developments in the theory itself and of the variety of its applications. This book, based on the 1981 AMS Short Course on the Mathematics of Networks, introduces most of the basic ideas of network theory and develops some of these ideas considerably. A number of more specialized topics are introduced, including areas of active research and a wide variety of applications. Frank Boesch gives the basic definitions in the mathematics of networks and in the closely-related topic of graph theory. He discusses two of the most fundamental network problems - the shortest path problem and the minimum spanning tree problem as well as some of their variants.Boesch also gives an interesting presentation in the area of network reliability. Frances Yao considers maximum flows in networks, the problem most often thought of in connection with the mathematics of networks. Richard Karp gives an account of the computational complexity of network problems. Using the case study method, Shen Lin demonstrates the effective use of heuristic algorithms in network design. Four applications of the mathematics of networks are presented by Daniel Kleitman. These include: the design of irrigation systems, the theory of electrical networks, the scheduling of delivery trucks, and the physics of ice. Finally, Nicholas Pippenger presents a chapter on telephone switching networks, an area of network theory that leads to difficult mathematics drawn from such apparently unrelated fields as harmonic analysis. N° de réf. du vendeur LU-9780821800317
Quantité disponible : 1 disponible(s)