Recently Viewed

New

Algorithmic Aspects of Graph Connectivity by Hiroshi Nagamochi 9780521878647

No reviews yet Write a Review
RRP: £88.00
Booksplease Price: £83.13
Booksplease saves you

  Bookmarks: Included free with every order
  Delivery: We ship to over 200 countries from the UK
  Range: Millions of books available
  Reviews: Booksplease rated "Excellent" on Trustpilot

  FREE UK DELIVERY: When You Buy 3 or More Books - Use code: FREEUKDELIVERY in your cart!

SKU:
9780521878647
MPN:
9780521878647
Available from Booksplease!
Availability: Usually dispatched within 4 working days

Frequently Bought Together:

Total: Inc. VAT
Total: Ex. VAT

Description

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.

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

About the Author
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.

Reviews
'... 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



Book Information
ISBN 9780521878647
Author Hiroshi Nagamochi
Format Hardback
Page Count 392
Imprint Cambridge University Press
Publisher Cambridge University Press
Weight(grams) 680g
Dimensions(mm) 234mm * 160mm * 33mm

Reviews

No reviews yet Write a Review

Booksplease  Reviews


J - United Kingdom

Fast and efficient way to choose and receive books

This is my second experience using Booksplease. Both orders dealt with very quickly and despatched. Now waiting for my next read to drop through the letterbox.

J - United Kingdom

T - United States

Will definitely use again!

Great experience and I have zero concerns. They communicated through the shipping process and if there was any hiccups in it, they let me know. Books arrived in perfect condition as well as being fairly priced. 10/10 recommend. I will definitely shop here again!

T - United States

R - Spain

The shipping was just superior

The shipping was just superior; not even one of the books was in contact with the shipping box -anywhere-, not even a corner or the bottom, so all the books arrived in perfect condition. The international shipping took around 2 weeks, so pretty great too.

R - Spain

J - United Kingdom

Found a hard to get book…

Finding a hard to get book on Booksplease and with it not being an over inflated price was great. Ordering was really easy with updates on despatch. The book was packaged well and in great condition. I will certainly use them again.

J - United Kingdom