Handbook of Graph Theory, Combinatorial Optimization, and Algorithms

Krishnaiyan "KT" Thulasiraman · Subramanian Arumugam · Andreas Brandstädt · Takao Nishizeki

янв. 2016 г. · Chapman & Hall/CRC Computer and Information Science Series Книга 5 · CRC Press

Об электронной книге

This handbook is the first to present a unified, comprehensive treatment of graph theory, combinatorial optimization, and related algorithmic issues. It covers numerous topics of interest in applications in electrical, communication, computer, social, transportation, biological, and other networks. 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, and design and plan graph structures that lead to certain desirable behavior.

Об авторе

Krishnaiyan "KT" Thulasiraman is a professor and Hitachi Chair in Computer Science at the University of Oklahoma and a professor emeritus in electrical and computer engineering at Concordia University in Montreal. He is a fellow of the IEEE, AAAS, and the European Academy of Sciences. Dr. Thulasiraman has received several honors, including the Distinguished Alumnus Award of the Indian Institute of Technology Madras, IEEE Circuits and Systems Society Charles Desoer Technical Achievement Award, and IEEE Circuits and Systems Society Golden Jubilee Medal. He is the coauthor of two graduate-level textbooks on graphs, electrical networks, and algorithms. His research interests include graph theory, combinatorial optimization, and related algorithmic issues with a specific focus on applications in electrical and computer engineering and network science.

Subramanian Arumugam is a senior professor and director of the National Centre for Advanced Research in Discrete Mathematics at Kalasalingam University. He is also a visiting professor at Liverpool Hope University and an adjunct professor at Ball State University. Dr. Arumugam is the founding editor-in-chief of AKCE International Journal of Graphs and Combinatorics and author of 32 books and 195 journal papers. His current research interests include graph theory and its applications.

Andreas Brandst retired as a professor in computer science from the University of Rostock after 20 years. Dr. Brandst has published extensively in various international journals and conference proceedings. He is also the author of a textbook and coauthor of a widely cited monograph.