Topics in Algorithmic Graph Theory
Topics in Algorithmic Graph Theory

Author: Lowell W. Beineke

Publisher: Cambridge University Press

Published: 2021-06-03

Total Pages: 400

ISBN-13: 1108671071

DOWNLOAD EBOOK

Algorithmic graph theory has been expanding at an extremely rapid rate since the middle of the twentieth century, in parallel with the growth of computer science and the accompanying utilization of computers, where efficient algorithms have been a prime goal. This book presents material on developments on graph algorithms and related concepts that will be of value to both mathematicians and computer scientists, at a level suitable for graduate students, researchers and instructors. The fifteen expository chapters, written by acknowledged international experts on their subjects, focus on the application of algorithms to solve particular problems. All chapters were carefully edited to enhance readability and standardize the chapter structure as well as the terminology and notation. The editors provide basic background material in graph theory, and a chapter written by the book's Academic Consultant, Martin Charles Golumbic (University of Haifa, Israel), provides background material on algorithms as connected with graph theory.

Algorithmic Graph Theory
Algorithmic Graph Theory

Author: Alan Gibbons

Publisher: Cambridge University Press

Published: 1985-06-27

Total Pages: 280

ISBN-13: 9780521288811

DOWNLOAD EBOOK

An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity.

Topics in Chromatic Graph Theory
Topics in Chromatic Graph Theory

Author: Lowell W. Beineke

Publisher: Cambridge University Press

Published: 2015-05-07

Total Pages: 416

ISBN-13: 1316239853

DOWNLOAD EBOOK

Chromatic graph theory is a thriving area that uses various ideas of 'colouring' (of vertices, edges, and so on) to explore aspects of graph theory. It has links with other areas of mathematics, including topology, algebra and geometry, and is increasingly used in such areas as computer networks, where colouring algorithms form an important feature. While other books cover portions of the material, no other title has such a wide scope as this one, in which acknowledged international experts in the field provide a broad survey of the subject. All fifteen chapters have been carefully edited, with uniform notation and terminology applied throughout. Bjarne Toft (Odense, Denmark), widely recognized for his substantial contributions to the area, acted as academic consultant. The book serves as a valuable reference for researchers and graduate students in graph theory and combinatorics and as a useful introduction to the topic for mathematicians in related fields.

Algorithmic Graph Theory and Perfect Graphs
Algorithmic Graph Theory and Perfect Graphs

Author: Martin Charles Golumbic

Publisher: Elsevier

Published: 2014-05-10

Total Pages: 307

ISBN-13: 1483271978

DOWNLOAD EBOOK

Algorithmic Graph Theory and Perfect Graphs provides an introduction to graph theory through practical problems. This book presents the mathematical and algorithmic properties of special classes of perfect graphs. Organized into 12 chapters, this book begins with an overview of the graph theoretic notions and the algorithmic design. This text then examines the complexity analysis of computer algorithm and explains the differences between computability and computational complexity. Other chapters consider the parameters and properties of a perfect graph and explore the class of perfect graphs known as comparability graph or transitively orientable graphs. This book discusses as well the two characterizations of triangulated graphs, one algorithmic and the other graph theoretic. The final chapter deals with the method of performing Gaussian elimination on a sparse matrix wherein an arbitrary choice of pivots may result in the filling of some zero positions with nonzeros. This book is a valuable resource for mathematicians and computer scientists.

Graph Theory with Algorithms and its Applications
Graph Theory with Algorithms and its Applications

Author: Santanu Saha Ray

Publisher: Springer Science & Business Media

Published: 2012-11-02

Total Pages: 223

ISBN-13: 8132207505

DOWNLOAD EBOOK

The book has many important features which make it suitable for both undergraduate and postgraduate students in various branches of engineering and general and applied sciences. The important topics interrelating Mathematics & Computer Science are also covered briefly. The book is useful to readers with a wide range of backgrounds including Mathematics, Computer Science/Computer Applications and Operational Research. While dealing with theorems and algorithms, emphasis is laid on constructions which consist of formal proofs, examples with applications. Uptill, there is scarcity of books in the open literature which cover all the things including most importantly various algorithms and applications with examples.

Handbook of Graph Theory
Handbook of Graph Theory

Author: Jonathan L. Gross

Publisher: CRC Press

Published: 2003-12-29

Total Pages: 1200

ISBN-13: 9780203490204

DOWNLOAD EBOOK

The Handbook of Graph Theory is the most comprehensive single-source guide to graph theory ever published. Best-selling authors Jonathan Gross and Jay Yellen assembled an outstanding team of experts to contribute overviews of more than 50 of the most significant topics in graph theory-including those related to algorithmic and optimization approach

Sparsity
Sparsity

Author: Jaroslav Nešetřil

Publisher: Springer Science & Business Media

Published: 2012-04-24

Total Pages: 472

ISBN-13: 3642278752

DOWNLOAD EBOOK

This is the first book devoted to the systematic study of sparse graphs and sparse finite structures. Although the notion of sparsity appears in various contexts and is a typical example of a hard to define notion, the authors devised an unifying classification of general classes of structures. This approach is very robust and it has many remarkable properties. For example the classification is expressible in many different ways involving most extremal combinatorial invariants. This study of sparse structures found applications in such diverse areas as algorithmic graph theory, complexity of algorithms, property testing, descriptive complexity and mathematical logic (homomorphism preservation,fixed parameter tractability and constraint satisfaction problems). It should be stressed that despite of its generality this approach leads to linear (and nearly linear) algorithms. Jaroslav Nešetřil is a professor at Charles University, Prague; Patrice Ossona de Mendez is a CNRS researcher et EHESS, Paris. This book is related to the material presented by the first author at ICM 2010.

Topics in Graph Theory
Topics in Graph Theory

Author: Wilfried Imrich

Publisher: CRC Press

Published: 2008-10-27

Total Pages: 219

ISBN-13: 1439865337

DOWNLOAD EBOOK

From specialists in the field, you will learn about interesting connections and recent developments in the field of graph theory by looking in particular at Cartesian products-arguably the most important of the four standard graph products. Many new results in this area appear for the first time in print in this book. Written in an accessible way,

Handbook of Graph Theory, Combinatorial Optimization, and Algorithms
Handbook of Graph Theory, Combinatorial Optimization, and Algorithms

Author: Krishnaiyan "KT" Thulasiraman

Publisher: CRC Press

Published: 2016-01-05

Total Pages: 1217

ISBN-13: 1420011073

DOWNLOAD EBOOK

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 c