Handbook of graph theory, combinatorial optimization, and algorithms
Author(s)
Bibliographic Information
Handbook of graph theory, combinatorial optimization, and algorithms
(Chapman & Hall/CRC computer and information science series / series editor, Sartaj Sahni)
CRC Press, c2016
- : hardback
Available at 10 libraries
  Aomori
  Iwate
  Miyagi
  Akita
  Yamagata
  Fukushima
  Ibaraki
  Tochigi
  Gunma
  Saitama
  Chiba
  Tokyo
  Kanagawa
  Niigata
  Toyama
  Ishikawa
  Fukui
  Yamanashi
  Nagano
  Gifu
  Shizuoka
  Aichi
  Mie
  Shiga
  Kyoto
  Osaka
  Hyogo
  Nara
  Wakayama
  Tottori
  Shimane
  Okayama
  Hiroshima
  Yamaguchi
  Tokushima
  Kagawa
  Ehime
  Kochi
  Fukuoka
  Saga
  Nagasaki
  Kumamoto
  Oita
  Miyazaki
  Kagoshima
  Okinawa
  Korea
  China
  Thailand
  United Kingdom
  Germany
  Switzerland
  France
  Belgium
  Netherlands
  Sweden
  Norway
  United States of America
-
Library, Research Institute for Mathematical Sciences, Kyoto University数研
: hardbackTHU||6||1200035928367
Note
Includes bibliographical references and index
Description and Table of Contents
Description
The fusion between graph theory and combinatorial optimization has led to theoretically profound and practically useful algorithms, yet there is no book that currently covers both areas together. Handbook of Graph Theory, Combinatorial Optimization, and Algorithms is the first to present a unified, comprehensive treatment of both graph theory and combinatorial optimization.
Divided into 11 cohesive sections, the handbook’s 44 chapters focus on graph theory, combinatorial optimization, and algorithmic issues. The book provides readers with the algorithmic and theoretical foundations to:
Understand phenomena as shaped by their graph structures
Develop needed algorithmic and optimization tools for the study of graph structures
Design and plan graph structures that lead to certain desirable behavior
With contributions from more than 40 worldwide experts, this handbook equips readers with the necessary techniques and tools to solve problems in a variety of applications. Readers gain exposure to the theoretical and algorithmic foundations of a wide range of topics in graph theory and combinatorial optimization, enabling them to identify (and hence solve) problems encountered in diverse disciplines, such as electrical, communication, computer, social, transportation, biological, and other networks.
Table of Contents
Basic Concepts and Algorithms. Flows in Networks. Algebraic Graph Theory. Structural Graph Theory. Planar Graphs. Interconnection Networks. Special Graphs. Partitioning. Matroids. Probabilistic Methods, Random Graph Models, and Randomized Algorithms. Coping with NP-Completeness.
by "Nielsen BookData"