Author: Gary Chartrand
Publisher: McGraw-Hill Companies
ISBN:
Category : Mathematics
Languages : en
Pages : 424
Get Book
Book Description
Designed as a bridge to cross the gap between mathematics and computer science, and planned as the mathematics base for computer science students, this maths text is designed to help the student develop an understanding of the concept of an efficient algorithm.
Author: Alan Gibbons
Publisher: Cambridge University Press
ISBN: 9780521288811
Category : Computers
Languages : en
Pages : 280
Get Book
Book Description
An introduction to pure and applied graph theory with an emphasis on algorithms and their complexity.
Author: Martin Charles Golumbic
Publisher: Elsevier
ISBN: 1483271978
Category : Mathematics
Languages : en
Pages : 307
Get Book
Book Description
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.
Author: Lowell W. Beineke
Publisher: Cambridge University Press
ISBN: 1108671071
Category : Mathematics
Languages : en
Pages : 400
Get Book
Book Description
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.
Author: Martin C. Golumbic
Publisher:
ISBN:
Category :
Languages : en
Pages : 284
Get Book
Book Description
Author: Martin Charles Golumbic
Publisher: Springer Science & Business Media
ISBN: 0387250360
Category : Mathematics
Languages : en
Pages : 296
Get Book
Book Description
Graph Theory, Combinatorics and Algorithms: Interdisciplinary Applications focuses on discrete mathematics and combinatorial algorithms interacting with real world problems in computer science, operations research, applied mathematics and engineering. The book contains eleven chapters written by experts in their respective fields, and covers a wide spectrum of high-interest problems across these discipline domains. Among the contributing authors are Richard Karp of UC Berkeley and Robert Tarjan of Princeton; both are at the pinnacle of research scholarship in Graph Theory and Combinatorics. The chapters from the contributing authors focus on "real world" applications, all of which will be of considerable interest across the areas of Operations Research, Computer Science, Applied Mathematics, and Engineering. These problems include Internet congestion control, high-speed communication networks, multi-object auctions, resource allocation, software testing, data structures, etc. In sum, this is a book focused on major, contemporary problems, written by the top research scholars in the field, using cutting-edge mathematical and computational techniques.
Author: Santanu Saha Ray
Publisher: Springer Science & Business Media
ISBN: 8132207505
Category : Technology & Engineering
Languages : en
Pages : 223
Get Book
Book Description
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.
Author: Dieter Jungnickel
Publisher: Springer Science & Business Media
ISBN: 3662038226
Category : Mathematics
Languages : en
Pages : 597
Get Book
Book Description
Revised throughout Includes new chapters on the network simplex algorithm and a section on the five color theorem Recent developments are discussed
Author: Jeremy Kepner
Publisher: SIAM
ISBN: 9780898719918
Category : Mathematics
Languages : en
Pages : 388
Get Book
Book Description
The current exponential growth in graph data has forced a shift to parallel computing for executing graph algorithms. Implementing parallel graph algorithms and achieving good parallel performance have proven difficult. This book addresses these challenges by exploiting the well-known duality between a canonical representation of graphs as abstract collections of vertices and edges and a sparse adjacency matrix representation. This linear algebraic approach is widely accessible to scientists and engineers who may not be formally trained in computer science. The authors show how to leverage existing parallel matrix computation techniques and the large amount of software infrastructure that exists for these computations to implement efficient and scalable parallel graph algorithms. The benefits of this approach are reduced algorithmic complexity, ease of implementation, and improved performance.
Author: Y. Alavi
Publisher: Wiley-Interscience
ISBN:
Category : Mathematics
Languages : en
Pages : 842
Get Book
Book Description
An applications-oriented text detailing the latest research in graph theory and computer science. Leading contributors cover such important topics as: tiling problems and graph factors; partitioning the nodes of a graph; diameter vulnerability in networks; edge-disjoint Hamiltonian cycles; the cochromatic number of graphs in a switching sequence; and more.
