You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
Reliability problems arise with increasing frequency as our modern systems of telecommunications, information transmission, transportation, and distribution become more and more complex. In December 1989 at DIMACS at Rutgers University, a Workshop on Reliability of Computer and Communications Networks was held to examine the discrete mathematical methods relevant to these problems. There were nearly ninety participants, including theoretical mathematicians, computer scientists, and electrical engineers from academia and industry, as well as network practitioners, engineers, and reliability planners from leading companies involved in the use of computer and communications networks. This volum...
None
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
None