Description
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