The first really thorough book to discuss this central notion in graph and network theory, emphasizing its algorithmic aspects.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Hiroshi Nagamochi is a professor at the Graduate School of Informatics, Kyoto University, Japan. He is a member of the Operations Research Society of Japan and the Information Processing Society.
Toshihide Ibaraki is a Professor with Kwansei Gakuin University, Japan and Professor Emeritus of Kyoto University, Japan. He is a Fellow of the ACM and Operations Research Society of Japan.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
Da: California Books, Miami, FL, U.S.A.
Condizione: New. Codice articolo I-9780521878647
Quantità: Più di 20 disponibili
Da: Majestic Books, Hounslow, Regno Unito
Condizione: New. Print on Demand pp. 392 Illus. Codice articolo 8295748
Quantità: 4 disponibili
Da: Kennys Bookshop and Art Galleries Ltd., Galway, GY, Irlanda
Condizione: 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. . . . . Codice articolo V9780521878647
Quantità: Più di 20 disponibili
Da: Ria Christie Collections, Uxbridge, Regno Unito
Condizione: New. In English. Codice articolo ria9780521878647_new
Quantità: Più di 20 disponibili
Da: THE SAINT BOOKSTORE, Southport, Regno Unito
Hardback. Condizione: New. This item is printed on demand. New copy - Usually dispatched within 5-9 working days. Codice articolo C9780521878647
Quantità: Più di 20 disponibili
Da: moluna, Greven, Germania
Gebunden. Condizione: New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. With applications in communication, transportation, and production, graph connectivity has thrived using the theory of complexity and algorithms in modern computer science. This is the first thorough book on this central notion in graph and network theory, . Codice articolo 446951903
Quantità: Più di 20 disponibili
Da: CitiRetail, Stevenage, Regno Unito
Hardcover. Condizione: new. Hardcover. 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 production, 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. With applications in communication, transportation, and production, graph connectivity has thrived using the theory of complexity and algorithms in modern computer science. This is the first thorough book on this central notion in graph and network theory, and covers new concepts and algorithms for quicker and more efficient computing. This item is printed on demand. Shipping may be from our UK warehouse or from our Australian or US warehouses, depending on stock availability. Codice articolo 9780521878647
Quantità: 1 disponibili
Da: Kennys Bookstore, Olney, MD, U.S.A.
Condizione: 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. Codice articolo V9780521878647
Quantità: Più di 20 disponibili
Da: preigu, Osnabrück, Germania
Buch. Condizione: Neu. Algorithmic Aspects of Graph Connectivity | Hiroshi Nagamochi (u. a.) | Buch | Gebunden | Englisch | 2010 | Cambridge University Press | EAN 9780521878647 | Verantwortliche Person für die EU: Libri GmbH, Europaallee 1, 36244 Bad Hersfeld, gpsr[at]libri[dot]de | Anbieter: preigu Print on Demand. Codice articolo 101763734
Quantità: 5 disponibili
Da: AHA-BUCH GmbH, Einbeck, Germania
Buch. Condizione: 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 production, 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. Codice articolo 9780521878647
Quantità: 1 disponibili