Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications, Series Number 123) by Hiroshi Nagamochi (PDF)

    4

     

    Ebook Info

    • Published: 2008
    • Number of pages: 392 pages
    • Format: PDF
    • File Size: 2.93 MB
    • Authors: Hiroshi Nagamochi

    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 comprehensively 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.

    User’s Reviews

    Editorial Reviews: Review “… 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 Book 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. Read more

    Reviews from Amazon users which were colected at the time this book was published on the website:

    Keywords

    Free Download Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications, Series Number 123) in PDF format
    Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications, Series Number 123) PDF Free Download
    Download Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications, Series Number 123) 2008 PDF Free
    Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications, Series Number 123) 2008 PDF Free Download
    Download Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications, Series Number 123) PDF
    Free Download Ebook Algorithmic Aspects of Graph Connectivity (Encyclopedia of Mathematics and its Applications, Series Number 123)

    Previous articleHomotopy Theory of Schemes by Fabien Morel (PDF)
    Next articleThe Riemann Hypothesis for Function Fields: Frobenius Flow and Shift Operators (London Mathematical Society Student Texts Book 80) by Machiel van Frankenhuijsen (PDF)