Graph theory, combinatorics, and algorithms : interdisciplinary applications

Resource Information

The work Graph theory, combinatorics, and algorithms : interdisciplinary applications represents a distinct intellectual or artistic creation found in University of Missouri Libraries. This resource is a combination of several types including: Work, Language Material, Books.

The Resource Graph theory, combinatorics, and algorithms : interdisciplinary applications

Label: Graph theory, combinatorics, and algorithms : interdisciplinary applications

Statement of responsibility: edited by Martin Charles Golumbic, Irith Ben-Arroyo Hartman

Summary: 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

Nature of contents

Context

Context of Graph theory, combinatorics, and algorithms : interdisciplinary applications