This important resource offers the first in-depth account of the graph dynamics system SER (Scheduling by Edge Reversal),. In Part 1: Edge-Reversal Dynamics, the author discusses the main applications and properties of SER, provides data from statistics and correlations computed over several graph c..
Although mathematical ideas underpin the study of neural networks, this book presents the fundamentals without the full mathematical apparatus. The author tackles virtually all aspects of the field, including artificial neurons as models of their real counterparts; the geometry of network action in ..
Including 11 survey papers from international experts in combinatorics, group theory and combinatorial topology, this volume presents contributions on design theory, Belyi functions, group theory, transitive graphs, regular maps, and Hurwitz problems. It reviews the state of the art in each of these..
Boundaries and Hulls of Euclidean Graphs: From Theory to Practice presents concepts and algorithms for finding convex, concave and polygon hulls of Euclidean graphs...
Beginning with the origin of the four color problem in 1852, the field of graph colorings has developed into one of the most popular areas of graph theory. Introducing graph theory with a coloring theme, this book explores connections between major topics in graph theory and graph colorings, includi..
Combinatorial Algorithms: Generation, Enumeration, and Search thoroughly outlines and analyzes combinatorial algorithms for generation, enumeration, and search applications. It provides a unified and focused collection of topics of interest in the area. The authors, synthesizing material that can on..
Highlighting both established and new results, this book provides an introduction to the methods used in the combinatorics of pattern avoidance and pattern enumeration in compositions and words. It describes the strengths and weaknesses of a wide variety of solution techniques and approaches, presen..
This book provides an introduction to the combinatorial aspects of normal ordering in the Weyl algebra and some of its close relatives. It discusses the Stirling numbers, closely related generalizations, and their role as normal ordering coefficients in the Weyl algebra. In addition to the combinato..
The first book devoted to the crossing number, an increasingly popular object of study with surprising connections. The field has matured into a large body of work, which includes identifiable core results and techniques. The book presents a wide variety of ideas and techniques in topological graph ..
Like its bestselling predecessor, this second edition develops the theory of elliptic curves to provide a basis for both number theoretic and cryptographic applications. It now includes new chapters on isogenies and hyperelliptic curves, a more complete treatment of the Tate–Lichtenbaum pairing, alt..