Algorithmic Aspects of Graph Connectivity
Author:   Hiroshi Nagamochi (Kyoto University, Japan) ,  Toshihide Ibaraki (Kwansei Gakuin University, Japan)
Publisher:   Cambridge University Press
ISBN:  

9781108735490


Pages:   391
Publication Date:   16 May 2019
Format:   Paperback
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Our Price $108.65 Quantity:  
Add to Cart

Share |

Algorithmic Aspects of Graph Connectivity


Add your own review!

Overview

Full Product Details

Author:   Hiroshi Nagamochi (Kyoto University, Japan) ,  Toshihide Ibaraki (Kwansei Gakuin University, Japan)
Publisher:   Cambridge University Press
Imprint:   Cambridge University Press
Dimensions:   Width: 15.60cm , Height: 2.00cm , Length: 23.40cm
Weight:   0.800kg
ISBN:  

9781108735490


ISBN 10:   1108735495
Pages:   391
Publication Date:   16 May 2019
Audience:   Professional and scholarly ,  Professional & Vocational
Format:   Paperback
Publisher's Status:   Active
Availability:   Manufactured on demand   Availability explained
We will order this item for you from a manufactured on demand supplier.

Table of Contents

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.

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


'... 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 ... A comprehensive graduate level text and a worth addition to a professional library. 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. Mukkai S. Krishnamoorthy, Mathematical Reviews


Author Information

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.

Tab Content 6

Author Website:  

Customer Reviews

Recent Reviews

No review item found!

Add your own review!

Countries Available

All regions
Latest Reading Guide

MRG2025CC

 

Shopping Cart
Your cart is empty
 Shopping cart
Mailing List

 

Sign up now