Martin Charles Golumbic – författare
Visar alla böcker från författaren Martin Charles Golumbic. Handla med fri frakt och snabb leverans.
19 produkter
19 produkter
E-bok
Engelska, 20041 013 kr
Läs direkt efter köp
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 treatment
Inbunden, Engelska, 2005
1 091 kr
Skickas inom 10-15 vardagar
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.
E-bok
PDF, Engelska, 20061 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.
Inbunden, Engelska, 2007
549 kr
Skickas inom 10-15 vardagar
This book ?nds its roots in the horror that engulfed us all around the globe as we experienced and watched with disbelief the events of September 11, 2001. Naturally, policy-makers around the world rushed to examine their law enforcement capabilities and the suitability of these tools to the new war on terror. This examination resulted in a wave of legislation around the world, aimed at increasing the power of law enforcement agencies. The digital environment was a major focus of these regulatory and legis- tive attempts. Given the horror of the events and the haste to provide law enforcement agencies with the best tools possible to ?ght the new threat, policy-makers moved forward without much public discussion. Legis- tors around the world rushed to do the same. No real public debate took place before the USA PATRIOT Act was approved by Congress, 6 weeks 1 after 9/11. Our concern is that the public’s voice is also needed in this process.
E-bok
PDF, Engelska, 2007655 kr
Läs direkt efter köp
This book ?nds its roots in the horror that engulfed us all around the globe as we experienced and watched with disbelief the events of September 11, 2001. Naturally, policy-makers around the world rushed to examine their law enforcement capabilities and the suitability of these tools to the new war on terror. This examination resulted in a wave of legislation around the world, aimed at increasing the power of law enforcement agencies. The digital environment was a major focus of these regulatory and legis- tive attempts. Given the horror of the events and the haste to provide law enforcement agencies with the best tools possible to ?ght the new threat, policy-makers moved forward without much public discussion. Legis- tors around the world rushed to do the same. No real public debate took place before the USA PATRIOT Act was approved by Congress, 6 weeks 1 after 9/11. Our concern is that the public’s voice is also needed in this process.
Del 57 - Annals of Discrete Mathematics
Algorithmic Graph Theory and Perfect Graphs
Inbunden, Engelska, 2004
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 treatment
Del 89 - Cambridge Studies in Advanced Mathematics
Tolerance Graphs
Inbunden, Engelska, 2004
1 577 kr
Skickas inom 7-10 vardagar
The study of algorithmic graph theory and structured families of graphs is an important branch of discrete mathematics. It finds numerous applications, from data transmission through networks to efficiently scheduling aircraft and crews, as well as contributing to breakthroughs in genetic analysis and studies of the brain. Especially important have been the theory and applications of new intersection graph models such as generalizations of permutation graphs and interval graphs. One of these is the study of tolerance graphs and tolerance orders. This book contains the first thorough study of tolerance graphs and related topics, indeed the authors have included proofs of major results previously unpublished in book form. It will act as a springboard for researchers, and especially graduate students, to pursue new directions of investigation. With many examples and exercises it is also suitable for use as the text for a graduate course in graph theory.
Inbunden, Engelska, 2025
331 kr
Skickas inom 5-8 vardagar
Häftad, Engelska, 2025
171 kr
Skickas inom 5-8 vardagar
Del 178 - Encyclopedia of Mathematics and its Applications
Topics in Algorithmic Graph Theory
Inbunden, Engelska, 2021
1 433 kr
Skickas inom 7-10 vardagar
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.
E-bok
Engelska, 20211 573 kr
Läs direkt efter köp
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.
E-bok
PDF, Engelska, 20211 630 kr
Läs direkt efter köp
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.
Häftad, Engelska, 2010
505 kr
Skickas inom 10-15 vardagar
This book ?nds its roots in the horror that engulfed us all around the globe as we experienced and watched with disbelief the events of September 11, 2001. Naturally, policy-makers around the world rushed to examine their law enforcement capabilities and the suitability of these tools to the new war on terror. This examination resulted in a wave of legislation around the world, aimed at increasing the power of law enforcement agencies. The digital environment was a major focus of these regulatory and legis- tive attempts. Given the horror of the events and the haste to provide law enforcement agencies with the best tools possible to ?ght the new threat, policy-makers moved forward without much public discussion. Legis- tors around the world rushed to do the same. No real public debate took place before the USA PATRIOT Act was approved by Congress, 6 weeks 1 after 9/11. Our concern is that the public’s voice is also needed in this process.
Häftad, Engelska, 2011
1 091 kr
Skickas inom 10-15 vardagar
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.
E-bok
PDF, Engelska, 2014756 kr
Läs direkt efter köp
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.
Del 2261 - Lecture Notes in Mathematics
Zeroth Book of Graph Theory
An Annotated Translation of Les Réseaux (ou Graphes)—André Sainte-Laguë (1926)
Häftad, Engelska, 2021
320 kr
Skickas inom 5-8 vardagar
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.
E-bok
PDF, Engelska, 2021764 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.
Häftad, Engelska, 2012
550 kr
Skickas inom 10-15 vardagar
This book constitutes the thoroughly refereed proceedings of the 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012) held in Jerusalem, Israel on June 26-28, 2012. The 29 revised full papers presented were carefully selected and reviewed from 78 submissions. The papers are solicited describing original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, randomized, parameterized, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations. The scope of WG includes all applications of graph-theoretic concepts in Computer Science, including data structures, data bases, programming languages, computational geometry, tools for software construction, communications, computing on the web, models of the web and scale-free networks, mobile computing, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, and pattern recognition
E-bok
PDF, Engelska, 2012712 kr
Läs direkt efter köp
This book constitutes the thoroughly refereed proceedings of the 38th International Workshop on Graph Theoretic Concepts in Computer Science (WG 2012) held in Jerusalem, Israel on June 26-28, 2012. The 29 revised full papers presented were carefully selected and reviewed from 78 submissions. The papers are solicited describing original results on all aspects of graph-theoretic concepts in Computer Science, e.g. structural graph theory, sequential, parallel, randomized, parameterized, and distributed graph and network algorithms and their complexity, graph grammars and graph rewriting systems, graph-based modeling, graph-drawing and layout, random graphs, diagram methods, and support of these concepts by suitable implementations. The scope of WG includes all applications of graph-theoretic concepts in Computer Science, including data structures, data bases, programming languages, computational geometry, tools for software construction, communications, computing on the web, models of the web and scale-free networks, mobile computing, concurrency, computer architectures, VLSI, artificial intelligence, graphics, CAD, operations research, and pattern recognition