Martin Charles Golumbic – författare
1 013 kr
Läs direkt efter köp
1 091 kr
Skickas inom 10-15 vardagar
1 416 kr
Läs direkt efter köp
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.
549 kr
Skickas inom 10-15 vardagar
655 kr
Läs direkt efter köp
Algorithmic Graph Theory and Perfect Graphs
780 kr
Skickas inom 10-15 vardagar
Algorithmic Graph Theory and Perfect Graphs, first published in 1980, has become the classic introduction to the field. This new Annals edition continues to convey the message that intersection graph models are a necessary and important tool for solving real-world problems. It remains a stepping stone from which the reader may embark on one of many fascinating research trails.
The past twenty years have been an amazingly fruitful period of research in algorithmic graph theory and structured families of graphs. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. These have lead to new families of perfect graphs and many algorithmic results. These are surveyed in the new Epilogue chapter in this second edition.
New edition of the "Classic" book on the topic Wonderful introduction to a rich research area Leading author in the field of algorithmic graph theory Beautifully written for the new mathematician or computer scientist Comprehensive treatmentTolerance Graphs
1 577 kr
Skickas inom 7-10 vardagar
331 kr
Skickas inom 5-8 vardagar
171 kr
Skickas inom 5-8 vardagar
Topics in Algorithmic Graph Theory
1 433 kr
Skickas inom 7-10 vardagar
1 573 kr
Läs direkt efter köp
1 630 kr
Läs direkt efter köp
505 kr
Skickas inom 10-15 vardagar
1 091 kr
Skickas inom 10-15 vardagar
756 kr
Läs direkt efter köp
Zeroth Book of Graph Theory
An Annotated Translation of Les Réseaux (ou Graphes)—André Sainte-Laguë (1926)
320 kr
Skickas inom 5-8 vardagar
764 kr
Läs direkt efter köp
Marking 94 years since its first appearance, this book provides an annotated translation of Sainte-Laguë''s seminal monograph Les réseaux (ou graphes), drawing attention to its fundamental principles and ideas.
Sainte-Laguë''s 1926 monograph appeared only in French, but in the 1990s H. Gropp published a number of English papers describing several aspects of the book. He expressed his hope that an English translation might sometime be available to the mathematics community.
In the 10 years following the appearance of Les réseaux (ou graphes), the development of graph theory continued, culminating in the publication of the first full book on the theory of finite and infinite graphs in 1936 by Dénes König. This remained the only well-known text until Claude Berge''s 1958 book on the theory and applications of graphs. By 1960, graph theory had emerged as a significant mathematical discipline of its own.
This book will be of interest to graph theoristsand mathematical historians.
550 kr
Skickas inom 10-15 vardagar
712 kr
Läs direkt efter köp