Download or read book Genetic Theory for Cubic Graphs written by Pouya Baniasadi and published by Springer. This book was released on 2015-07-15 with total page 127 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book was motivated by the notion that some of the underlying difficulty in challenging instances of graph-based problems (e.g., the Traveling Salesman Problem) may be “inherited” from simpler graphs which – in an appropriate sense – could be seen as “ancestors” of the given graph instance. The authors propose a partitioning of the set of unlabeled, connected cubic graphs into two disjoint subsets named genes and descendants, where the cardinality of the descendants dominates that of the genes. The key distinction between the two subsets is the presence of special edge cut sets, called cubic crackers, in the descendants. The book begins by proving that any given descendant may be constructed by starting from a finite set of genes and introducing the required cubic crackers through the use of six special operations, called breeding operations. It shows that each breeding operation is invertible, and these inverse operations are examined. It is therefore possible, for any given descendant, to identify a family of genes that could be used to generate the descendant. The authors refer to such a family of genes as a “complete family of ancestor genes” for that particular descendant. The book proves the fundamental, although quite unexpected, result that any given descendant has exactly one complete family of ancestor genes. This result indicates that the particular combination of breeding operations used strikes the right balance between ensuring that every descendant may be constructed while permitting only one generating set. The result that any descendant can be constructed from a unique set of ancestor genes indicates that most of the structure in the descendant has been, in some way, inherited from that, very special, complete family of ancestor genes, with the remaining structure induced by the breeding operations. After establishing this, the authors proceed to investigate a number of graph theoretic properties: Hamiltonicity, bipartiteness, and planarity, and prove results linking properties of the descendant to those of the ancestor genes. They develop necessary (and in some cases, sufficient) conditions for a descendant to contain a property in terms of the properties of its ancestor genes. These results motivate the development of parallelizable heuristics that first decompose a graph into ancestor genes, and then consider the genes individually. In particular, they provide such a heuristic for the Hamiltonian cycle problem. Additionally, a framework for constructing graphs with desired properties is developed, which shows how many (known) graphs that constitute counterexamples of conjectures could be easily found.
Download or read book Hamiltonian Cycle Problem and Markov Chains written by Vivek S. Borkar and published by Springer Science & Business Media. This book was released on 2012-04-23 with total page 205 pages. Available in PDF, EPUB and Kindle. Book excerpt: This research monograph summarizes a line of research that maps certain classical problems of discrete mathematics and operations research - such as the Hamiltonian Cycle and the Travelling Salesman Problems - into convex domains where continuum analysis can be carried out. Arguably, the inherent difficulty of these, now classical, problems stems precisely from the discrete nature of domains in which these problems are posed. The convexification of domains underpinning these results is achieved by assigning probabilistic interpretation to key elements of the original deterministic problems. In particular, the approaches summarized here build on a technique that embeds Hamiltonian Cycle and Travelling Salesman Problems in a structured singularly perturbed Markov decision process. The unifying idea is to interpret subgraphs traced out by deterministic policies (including Hamiltonian cycles, if any) as extreme points of a convex polyhedron in a space filled with randomized policies. The above innovative approach has now evolved to the point where there are many, both theoretical and algorithmic, results that exploit the nexus between graph theoretic structures and both probabilistic and algebraic entities of related Markov chains. The latter include moments of first return times, limiting frequencies of visits to nodes, or the spectra of certain matrices traditionally associated with the analysis of Markov chains. However, these results and algorithms are dispersed over many research papers appearing in journals catering to disparate audiences. As a result, the published manuscripts are often written in a very terse manner and use disparate notation, thereby making it difficult for new researchers to make use of the many reported advances. Hence the main purpose of this book is to present a concise and yet easily accessible synthesis of the majority of the theoretical and algorithmic results obtained so far. In addition, the book discusses numerous open questions and problems that arise from this body of work and which are yet to be fully solved. The approach casts the Hamiltonian Cycle Problem in a mathematical framework that permits analytical concepts and techniques, not used hitherto in this context, to be brought to bear to further clarify both the underlying difficulty of NP-completeness of this problem and the relative exceptionality of truly difficult instances. Finally, the material is arranged in such a manner that the introductory chapters require very little mathematical background and discuss instances of graphs with interesting structures that motivated a lot of the research in this topic. More difficult results are introduced later and are illustrated with numerous examples.
Download or read book Modern Applications of Graph Theory written by Vadim Zverovich and published by Oxford University Press. This book was released on 2021-04-01 with total page 400 pages. Available in PDF, EPUB and Kindle. Book excerpt: Modern Applications of Graph Theory discusses many cutting-edge applications of graph theory, such as traffic networks, navigable networks and optimal routing for emergency response, placement of electric vehicle charging stations, and graph-theoretic methods in molecular epidemiology. Due to the rapid growth of research in this field, the focus of the book is on the up-to-date development of these applications and the mathematical methods used to tackle them. Ideal for researchers, engineers, transport planners and emergency response specialists who are interested in graph theory applications, Modern Applications of Graph Theory can also be used as teaching material. In addition to up-to-date descriptions of the applications, it includes extensive exercises and their solutions, mimicking practical, real-life situations. Furthermore, there is an introductory chapter, which provides an overview of basic applications and algorithms of graph theory. The book includes over 120 illustrations and tables.
Download or read book Number Theory and Combinatorics written by Bruce M. Landman and published by Walter de Gruyter GmbH & Co KG. This book was released on 2022-04-19 with total page 370 pages. Available in PDF, EPUB and Kindle. Book excerpt: Over a career that spanned 60 years, Ronald L. Graham (known to all as Ron) made significant contributions to the fields of discrete mathematics, number theory, Ramsey theory, computational geometry, juggling and magical mathematics, and many more. Ron also was a mentor to generations of mathematicians, he gave countless talks and helped bring mathematics to a wider audience, and he held signifi cant leadership roles in the mathematical community. This volume is dedicated to the life and memory of Ron Graham, and includes 20-articles by leading scientists across a broad range of subjects that refl ect some of the many areas in which Ron worked.
Download or read book Handbook of Research on Novel Soft Computing Intelligent Algorithms written by Pandian Vasant and published by IGI Global. This book was released on 2013-08-31 with total page 1173 pages. Available in PDF, EPUB and Kindle. Book excerpt: "This book explores emerging technologies and best practices designed to effectively address concerns inherent in properly optimizing advanced systems, demonstrating applications in areas such as bio-engineering, space exploration, industrial informatics, information security, and nuclear and renewable energies"--Provided by publisher.
Download or read book Dynamic Models in Biology written by Stephen P. Ellner and published by Princeton University Press. This book was released on 2006-04-16 with total page 353 pages. Available in PDF, EPUB and Kindle. Book excerpt: From controlling disease outbreaks to predicting heart attacks, dynamic models are increasingly crucial for understanding biological processes. Many universities are starting undergraduate programs in computational biology to introduce students to this rapidly growing field. In Dynamic Models in Biology, the first text on dynamic models specifically written for undergraduate students in the biological sciences, ecologist Stephen Ellner and mathematician John Guckenheimer teach students how to understand, build, and use dynamic models in biology. Developed from a course taught by Ellner and Guckenheimer at Cornell University, the book is organized around biological applications, with mathematics and computing developed through case studies at the molecular, cellular, and population levels. The authors cover both simple analytic models--the sort usually found in mathematical biology texts--and the complex computational models now used by both biologists and mathematicians. Linked to a Web site with computer-lab materials and exercises, Dynamic Models in Biology is a major new introduction to dynamic models for students in the biological sciences, mathematics, and engineering.
Download or read book Computational Characterisation of Gold Nanocluster Structures written by Andrew James Logsdail and published by Springer Science & Business Media. This book was released on 2013-08-31 with total page 220 pages. Available in PDF, EPUB and Kindle. Book excerpt: In this thesis, Andrew Logsdail demonstrates that computational chemistry is a powerful tool in contemporary nanoscience, complementing experimental observations and helping guide future experiments. The aim of this particular PhD is to further our understanding of structural and compositional preferences in gold nanoparticles, as well as the compositional and chemical ordering preferences in bimetallic nanoalloys formed with other noble metals, such as palladium and platinum. Highlights include: calculations of the structural preferences and optical-response of gold nanoparticles and gold-containing nanoalloys; the design and implementation of novel numerical algorithms for the structural characterisation of gold nanoparticles from electron microscopy images; and electronic structure calculations investigating the interaction of gold nanoparticles with graphene and graphite substrates.The results presented here have significant implications for future research on the chemical and physical properties of gold-based nanoparticles and are of interest to many researchers working on experimental and theoretical aspects of nanoscience.
Download or read book Evolvable Hardware written by Tetsuya Higuchi and published by Springer Science & Business Media. This book was released on 2006-11-02 with total page 227 pages. Available in PDF, EPUB and Kindle. Book excerpt: Evolvable hardware (EHW) refers to hardware whose architecture/structure and functions change dynamically and autonomously in order to improve its performance in carrying out tasks. The only single resource presenting both the fundamentals, and the latest advances in the field, this book teaches the basics of reconfigurable devices, why they are necessary and how they are designed.
Download or read book Traveling Salesman Problem written by Federico Greco and published by BoD – Books on Demand. This book was released on 2008-09-01 with total page 214 pages. Available in PDF, EPUB and Kindle. Book excerpt: The idea behind TSP was conceived by Austrian mathematician Karl Menger in mid 1930s who invited the research community to consider a problem from the everyday life from a mathematical point of view. A traveling salesman has to visit exactly once each one of a list of m cities and then return to the home city. He knows the cost of traveling from any city i to any other city j. Thus, which is the tour of least possible cost the salesman can take? In this book the problem of finding algorithmic technique leading to good/optimal solutions for TSP (or for some other strictly related problems) is considered. TSP is a very attractive problem for the research community because it arises as a natural subproblem in many applications concerning the every day life. Indeed, each application, in which an optimal ordering of a number of items has to be chosen in a way that the total cost of a solution is determined by adding up the costs arising from two successively items, can be modelled as a TSP instance. Thus, studying TSP can never be considered as an abstract research with no real importance.
Download or read book Integer Programming and Related Areas written by Rabe v. Randow and published by Springer Science & Business Media. This book was released on 2012-12-06 with total page 522 pages. Available in PDF, EPUB and Kindle. Book excerpt: The fields of integer programming and combinatorial optimization continue to be areas of great vitality, with an ever increasing number of publications and journals appearing. A classified bibliography thus continues to be necessary and useful today, even more so than it did when the project, of which this is the fifth volume, was started in 1970 in the Institut fur Okonometrie und Operations Research of the University of Bonn. The pioneering first volume was compiled by Claus Kastning during the years 1970 - 1975 and appeared in 1976 as Volume 128 of the series Lecture Notes in Economics and Mathematical Systems published by the Springer Verlag. Work on the project was continued by Dirk Hausmann, Reinhardt Euler, and Rabe von Randow, and resulted in the publication of the second, third, and fourth volumes in 1978, 1982, and 1985 (Volumes 160, 197, and 243 of the above series). The present book constitutes the fifth volume of the bibliography and covers the period from autumn 1984 to the end of 1987. It contains 5864 new publications by 4480 authors and was compiled by Rabe von Randow. Its form is practically identical to that of the first four volumes, some additions having been made to the subject list.
Download or read book Handbook of Research on Advanced Applications of Graph Theory in Modern Society written by Pal, Madhumangal and published by IGI Global. This book was released on 2019-08-30 with total page 615 pages. Available in PDF, EPUB and Kindle. Book excerpt: In the world of mathematics and computer science, technological advancements are constantly being researched and applied to ongoing issues. Setbacks in social networking, engineering, and automation are themes that affect everyday life, and researchers have been looking for new techniques in which to solve these challenges. Graph theory is a widely studied topic that is now being applied to real-life problems. The Handbook of Research on Advanced Applications of Graph Theory in Modern Society is an essential reference source that discusses recent developments on graph theory, as well as its representation in social networks, artificial neural networks, and many complex networks. The book aims to study results that are useful in the fields of robotics and machine learning and will examine different engineering issues that are closely related to fuzzy graph theory. Featuring research on topics such as artificial neural systems and robotics, this book is ideally designed for mathematicians, research scholars, practitioners, professionals, engineers, and students seeking an innovative overview of graphic theory.
Download or read book Abstracts of Papers Presented to the American Mathematical Society written by American Mathematical Society and published by . This book was released on 1995 with total page 508 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Optimization Problems in Graph Theory written by Boris Goldengorin and published by Springer. This book was released on 2018-09-27 with total page 341 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book presents open optimization problems in graph theory and networks. Each chapter reflects developments in theory and applications based on Gregory Gutin’s fundamental contributions to advanced methods and techniques in combinatorial optimization. Researchers, students, and engineers in computer science, big data, applied mathematics, operations research, algorithm design, artificial intelligence, software engineering, data analysis, industrial and systems engineering will benefit from the state-of-the-art results presented in modern graph theory and its applications to the design of efficient algorithms for optimization problems. Topics covered in this work include: · Algorithmic aspects of problems with disjoint cycles in graphs · Graphs where maximal cliques and stable sets intersect · The maximum independent set problem with special classes · A general technique for heuristic algorithms for optimization problems · The network design problem with cut constraints · Algorithms for computing the frustration index of a signed graph · A heuristic approach for studying the patrol problem on a graph · Minimum possible sum and product of the proper connection number · Structural and algorithmic results on branchings in digraphs · Improved upper bounds for Korkel--Ghosh benchmark SPLP instances
Download or read book Learn from the Masters written by Frank Swetz and published by Cambridge University Press. This book was released on 1995 with total page 322 pages. Available in PDF, EPUB and Kindle. Book excerpt: This book is for high school and college teachers who want to know how they can use the history of mathematics as a pedagogical tool to help their students construct their own knowledge of mathematics. Often, a historical development of a particular topic is the best way to present a mathematical topic, but teachers may not have the time to do the research needed to present the material. This book provides its readers with historical ideas and insights which can be immediately applied in the classroom. The book is divided into two sections: the first on the use of history in high school mathematics, and the second on its use in university mathematics. The articles are diverse, covering fields such as trigonometry, mathematical modeling, calculus, linear algebra, vector analysis, and celestial mechanics. Also included are articles of a somewhat philosophical nature, which give general ideas on why history should be used in teaching and how it can be used in various special kinds of courses. Each article contains a bibliography to guide the reader to further reading on the subject.
Download or read book Mathematical Reviews written by and published by . This book was released on 2008 with total page 916 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Graph Theory Bibliography with Two Level Key word Index Key word index Author index written by Gerald Berman and published by . This book was released on 1983 with total page 418 pages. Available in PDF, EPUB and Kindle. Book excerpt:
Download or read book Solved and Unsolved Problems in Number Theory written by Daniel Shanks and published by American Mathematical Society. This book was released on 2024-01-24 with total page 321 pages. Available in PDF, EPUB and Kindle. Book excerpt: The investigation of three problems, perfect numbers, periodic decimals, and Pythagorean numbers, has given rise to much of elementary number theory. In this book, Daniel Shanks, past editor of Mathematics of Computation, shows how each result leads to further results and conjectures. The outcome is a most exciting and unusual treatment. This edition contains a new chapter presenting research done between 1962 and 1978, emphasizing results that were achieved with the help of computers.
