You may have to Search all our reviewed books and magazines, click the sign up button below to create a free account.
With a growing range of applications in fields from computer science to chemistry and communications networks, graph theory has enjoyed a rapid increase of interest and widespread recognition as an important area of mathematics. Through more than 20 years of publication, Graphs & Digraphs has remained a popular point of entry to the field, and through its various editions, has evolved with the field from a purely mathematical treatment to one that also addresses the mathematical needs of computer scientists. Carefully updated, streamlined, and enhanced with new features, Graphs & Digraphs, Fourth Edition reflects many of the developments in graph theory that have emerged in recent years. The...
Statistics Using R introduces the most up-to-date approaches to R programming alongside an introduction to applied statistics using real data in the behavioral, social, and health sciences. It is uniquely focused on the importance of data management as an underlying and key principle of data analysis. It includes an online R tutorial for learning the basics of R, as well as two R files for each chapter, one in Base R code and the other in tidyverse R code, that were used to generate all figures, tables, and analyses for that chapter. These files are intended as models to be adapted and used by readers in conducting their own research. Additional teaching and learning aids include solutions to all end-of-chapter exercises and PowerPoint slides to highlight the important take-aways of each chapter. This textbook is appropriate for both undergraduate and graduate students in social sciences, applied statistics, and research methods.
Clear, lively style covers all basics of theory and application, including mathematical models, elementary graph theory, transportation problems, connection problems, party problems, diagraphs and mathematical models, games and puzzles, more.
Iintroductory treatment emphasizes graph imbedding but also covers connections between topological graph theory and other areas of mathematics. Authors explore the role of voltage graphs in the derivation of genus formulas, explain the Ringel-Youngs theorem, and examine the genus of a group, including imbeddings of Cayley graphs. Many figures. 1987 edition.
Statistics Using Stata uses a highly accessible and lively writing style to seamlessly integrate the learning of the latest version of Stata (17) with an introduction to applied statistics using real data in the behavioral, social, and health sciences. The text is comprehensive in its content coverage and is suitable at undergraduate and graduate levels. It requires knowledge of basic algebra, but no prior coding experience. It is uniquely focused on the importance of data management as an underlying and key principle of data analysis. It includes a .do-file for each chapter, that was used to generate all figures, tables, and analyses for that chapter. These files are intended as models to be adapted and used by readers in conducting their own research. Additional teaching and learning aids include solutions to all end-of-chapter exercises and PowerPoint slides to highlight the important take-aways of each chapter.
This book contains Volumes 4 and 5 of the Journal of Graph Algorithms and Applications (JGAA) . The first book of this series, Graph Algorithms and Applications 1, published in March 2002, contains Volumes 1OCo3 of JGAA . JGAA is a peer-reviewed scientific journal devoted to the publication of high-quality research papers on the analysis, design, implementation, and applications of graph algorithms. Areas of interest include computational biology, computational geometry, computer graphics, computer-aided design, computer and interconnection networks, constraint systems, databases, graph drawing, graph embedding and layout, knowledge representation, multimedia, software engineering, telecommu...
This is the most comprehensive survey of the mathematical life of the legendary Paul Erdős (1913-1996), one of the most versatile and prolific mathematicians of our time. For the first time, all the main areas of Erdős' research are covered in a single project. Because of overwhelming response from the mathematical community, the project now occupies over 1000 pages, arranged into two volumes. These volumes contain both high level research articles as well as key articles that survey some of the cornerstones of Erdős' work, each written by a leading world specialist in the field. A special chapter "Early Days", rare photographs, and art related to Erdős complement this striking collectio...
A survey of some of the work that has been done since the appearance of the second edition of Combinatorial Algorithms. Topics include progress in: Gray Codes, listing of subsets of given size of a given universe, listing rooted and free trees, selecting free trees and unlabeled graphs uniformly at random, and ranking and unranking problems on unlabeled trees.