Cantitate/Preț
Produs

Algorithmic Aspects of Graph Connectivity: Encyclopedia of Mathematics and its Applications, cartea 123

Autor Hiroshi Nagamochi, Toshihide Ibaraki
en Limba Engleză Paperback – 15 mai 2019
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.
Citește tot Restrânge

Toate formatele și edițiile

Toate formatele și edițiile Preț Express
Paperback (1) 32389 lei  6-8 săpt.
  Cambridge University Press – 15 mai 2019 32389 lei  6-8 săpt.
Hardback (1) 61301 lei  6-8 săpt.
  Cambridge University Press – 7 sep 2008 61301 lei  6-8 săpt.

Din seria Encyclopedia of Mathematics and its Applications

Preț: 32389 lei

Preț vechi: 40487 lei
-20% Nou

Puncte Express: 486

Preț estimativ în valută:
6201 6445$ 5141£

Carte tipărită la comandă

Livrare economică 05-19 februarie 25

Preluare comenzi: 021 569.72.76

Specificații

ISBN-13: 9781108735490
ISBN-10: 1108735495
Pagini: 391
Dimensiuni: 156 x 234 x 20 mm
Greutate: 0.55 kg
Editura: Cambridge University Press
Colecția Cambridge University Press
Seria Encyclopedia of Mathematics and its Applications

Locul publicării:New York, United States

Cuprins

1. Introduction; 2. MA ordering and forest decompositions; 3. Minimum cuts; 4. Cut enumeration; 5. Cactus representations; 6. Extreme vertex sets; 7. Edge-splitting; 8. Connectivity augmentation; 9. Source location problems; 10. Submodular and posi-modular set functions.

Recenzii

'… a comprehensive graduate level text and a worthy addition to a professional library.' SciTech Book News
'This fine graduate-level textbook discusses the algorithmic efficiency of graph connectivity problems. What is impressive about this book is the unified framework in which algorithmic efficiency is discussed.' Mathematical Reviews
'This excellent book can be an important source for researchers and a valuable textbook for graduate students.' Zentralblatt MATH
'… comprehensive and detailed …' EMS Newsletter

Notă biografică


Descriere

The first really thorough book to discuss this central notion in graph and network theory, emphasizing its algorithmic aspects.