Combinatorics and graph theory

Introduction to Radar Analysis, Second Edition is a major revision of the popular textbook.

This book presents a new approach that can be applied to complex, integrated individual and social human processes.

This volume comprises 16 contributions that present advanced topics in graph domination, featuring open problems, modern techniques, and recent results.

This book presents current research in the area of advanced monitoring in P2P botnets, and uses a dual-perspective approach to discuss aspects of botnet monitoring in-depth.

The first book devoted exclusively to quantitative graph theory, Quantitative Graph Theory: Mathematical Foundations and Applications presents and demonstrates existing and novel methods for analyzing graphs quantitatively.

This book focuses on the theoretical side of temporal network research and gives an overview of the state of the art in the field.

From the Rosetta Stone to public-key cryptography, the art and science of cryptology has been used to unlock the vivid history of ancient cultures, to turn the tide of warfare, and to thwart potential hackers from attacking computer systems.

Commutation Relations, Normal Ordering, and Stirling Numbers provides an introduction to the combinatorial aspects of normal ordering in the Weyl algebra and some of its close relatives.

Naive Set Theory: A Rigorous Approach aims to provide a complete and unitary presentation of naive set theory as the foundation of the whole mathematics.

The present book is the result of a three year research project which investigated the creative act of composing by means of algorithmic composition.

This book reports on the development and assessment of a novel framework for studying neural interactions (the connectome) and their dynamics (the chronnectome).

Aspects of Integration: Novel Approaches to the Riemann and Lebesgue Integrals is comprised of two parts.

This book examines some issues involving climate change, human trafficking, and other serious world challenges made worse by climate change.

Evolutionary algorithms constitute a class of well-known algorithms, which are designed based on the Darwinian theory of evolution and Mendelian theory of heritage.

The volume is a collection of 20 refereed articles written in connection with lectures presented at the 12th International Conference on Finite Fields and Their Applications ('Fq12') at Skidmore College in Saratoga Springs, NY in July 2015.

Current developments in air pollution modelling are explored as a series of contributions from researchers at the forefront of their field.

Poised to become the leading reference in the field, the Handbook of Finite Fields is exclusively devoted to the theory and applications of finite fields.

This textbook provides an exciting new addition to the area of network science featuring a stronger and more methodical link of models to their mathematical origin and explains how these relate to each other with special focus on epidemic spread on networks.

Increased interest in graph theory in recent years has led to a demand for more textbooks on the subject.

This book presents the latest research on honeypots and their applications.

The book studies the existing and potential connections between Social Network Analysis (SNA) and Formal Concept Analysis (FCA) by showing how standard SNA techniques, usually based on graph theory, can be supplemented by FCA methods, which rely on lattice theory.

The authors discuss comprehensively the generalization of results and applications to quasi-symmetric designs.

This volume contains the invited talks from the 18th British Combinatorial Conference, held in 2001.

Percolation theory describes the effects of the connectivity of microscopic or small-scale elements of a complex medium to its macroscopic or large-scale properties.

This book gives an advanced overview of several topics in infinite group theory.

Introduces network inspired approaches for the analysis and integration of large, heterogeneous data sets in the life sciences.

Gottfried Wilhelm Leibniz: The Polymath Who Brought Us Calculus focuses on the life and accomplishments of one of the seventeenth century's most influential mathematicians and philosophers.

Surveys trends arising from the applications and interactions between combinatorics, symbolic dynamics and theoretical computer science.

This important resource offers the first in-depth account of the graph dynamics system SER (Scheduling by Edge Reversal),.

Unlike most elementary books on matrices, A Combinatorial Approach to Matrix Theory and Its Applications employs combinatorial and graph-theoretical tools to develop basic theorems of matrix theory, shedding new light on the subject by exploring the connections of these tools to matrices.

Presenting the state of the art, the Handbook of Enumerative Combinatorics brings together the work of today's most prominent researchers.

This graduate-level text gives a thorough overview of the analysis of Boolean functions, beginning with the most basic definitions and proceeding to advanced topics.

Automata and Computability is a class-tested textbook which provides a comprehensive and accessible introduction to the theory of automata and computation.

This is the most readable and thorough graduate textbook and reference for combinatorics, covering enumeration, graphs, sets, and methods.

Fifty years ago, a new approach to reaction kinetics began to emerge: one based on mathematical models of reaction kinetics, or formal reaction kinetics.

A broad survey written by acknowledged international experts in the field.

Survey articles based on the invited lectures given at the Twenty-second British Combinatorial Conference.

This book presents a thoughtful compilation of chapters derived from the proceedings of the 8th International Arab Conference on Mathematics and Computations (IACMC 2023), held at Zarqa University in Zarqa, Jordan, from 10-12 May 2023.

This book introduces the fundamentals of computer vision (CV), with a focus on extracting useful information from digital images and videos.

A Mathematical Tour introduces readers to a selection of mathematical topics chosen for their centrality, importance, historical significance, and intrinsic appeal and beauty.

Now the most used texbook for introductory cryptography courses in both mathematics and computer science, the Third Edition builds upon previous editions by offering several new sections, topics, and exercises.

This book includes nine articles representing a timely snapshot of the state of the art in the different areas of combinatorics.

From the Rosetta Stone to public-key cryptography, the art and science of cryptology has been used to unlock the vivid history of ancient cultures, to turn the tide of warfare, and to thwart potential hackers from attacking computer systems.

Although much literature exists on the subject of RSA and public-key cryptography, until now there has been no single source that reveals recent developments in the area at an accessible level.

This volume in the Encyclopedia of Complexity and Systems Science (ECSS) covers such fascinating and practical topics as (i) Vehicular traffic flow theory, (ii) Studies of real field traffic data, (iii) Complex phenomena of self-organization in vehicular traffic, (iv) Effect of automatic driving (self-driving vehicles) on traffic flow, v) Complex dynamics of city traffic, (vi) Dynamic control and optimization of traffic and transportation networks, including dynamic traffic assignment in the network, (vii) Pedestrian traffic, (viii) Evacuation scenarios, and (ix) Network characteristics of air control.

?