9780521878647 - algorithmic aspects of graph connectivity (encyclopedia of mathematics & its applications, 123, band 123) von nagamochi, hiroshi; ibaraki, toshihide (3 Ergebnisse)
Sprache: Englisch
Verlag: Cambridge University Press 2008
Serie: Encyclopedia of Mathematics and its Applications, Buch 112 von 188. Buch 112 von 188 - Encyclopedia of Mathematics and its Applications
- Hardcover
Anbieter: Ria Christie Collections, Uxbridge, Vereinigtes KönigreichRia Christie Collections
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 117,94
EUR 13,86 VersandVersand von Vereinigtes Königreich nach USAAnzahl: Mehr als 20 verfügbar
Zustand: New. In.
Sprache: Englisch
Verlag: Cambridge University Press 2008
Serie: Encyclopedia of Mathematics and its Applications, Buch 112 von 188. Buch 112 von 188 - Encyclopedia of Mathematics and its Applications
- Hardcover
Anbieter: Kennys Bookstore, Olney, MD, USAKennys Bookstore
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 168,65
EUR 9,06 VersandVersand innerhalb von USAAnzahl: Mehr als 20 verfügbar
Zustand: New. The first really thorough book to discuss this central notion in graph and network theory, emphasising its algorithmic aspects. Series: Encyclopedia of Mathematics and Its Applications. Num Pages: 392 pages, 1 table. BIC Classification: PBV. Category: (U) Tertiary Education (US: College). Dimension: 234 x 156 x 22.… Weight in Grams: 720. . 2008. 1st Edition. hardcover. . . . . Books ship from the US and Ireland.
Sprache: Englisch
Verlag: Cambridge University Press 2008
Serie: Encyclopedia of Mathematics and its Applications, Buch 112 von 188. Buch 112 von 188 - Encyclopedia of Mathematics and its Applications
- Hardcover
Anbieter: AHA-BUCH GmbH, Einbeck, DeutschlandAHA-BUCH GmbH
Verkäufer/-in kontaktierenVerkäufer/-in mit 5 SternenZustand: Neu
EUR 157,97
EUR 63,76 VersandVersand von Deutschland nach USAAnzahl: 1 verfügbar
Buch. Zustand: Neu. Druck auf Anfrage Neuware - Printed after ordering - Algorithmic Aspects of Graph Connectivity is the first comprehensive book on this central notion in graph and network theory, emphasizing its algorithmic aspects. Because of its wide applications in the fields of communication, transportation, and productio…n, graph connectivity has made tremendous algorithmic progress under the influence of the theory of complexity and algorithms in modern computer science. The book contains various definitions of connectivity, including edge-connectivity and vertex-connectivity, and their ramifications, as well as related topics such as flows and cuts. The authors thoroughly discuss new concepts and algorithms that allow for quicker and more efficient computing, such as maximum adjacency ordering of vertices. Covering both basic definitions and advanced topics, this book can be used as a textbook in graduate courses in mathematical sciences, such as discrete mathematics, combinatorics, and operations research, and as a reference book for specialists in discrete mathematics and its applications.
