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.
Die algorithmische Graphentheorie ist ein Bereich der Informatik, der sich mit der Entwicklung und Analyse von Algorithmen für Probleme befasst, welche mithilfe von Graphen modelliert werden.
Complex Networks: An Algorithmic Perspective supplies the basic theoretical algorithmic and graph theoretic knowledge needed by every researcher and student of complex networks.
Ziel dieser vollständig überarbeiteten und erweiterten Neuauflage ist es, eine weitgehend elementare Einführung in ausgewählte Teile der Kombinatorik zu geben.
The International Conference on Complex Networks (CompleNet) brings together researchers and practitioners from diverse disciplines working on areas related to complex networks.
Combinatorics and finite fields are of great importance in modern applications such as in the analysis of algorithms, in information and communication theory, and in signal processing and coding theory.
The Handbook of Financial Cryptography and Security elucidates the theory and techniques of cryptography and illustrates how to establish and maintain security under the framework of financial cryptography.
Combinatorics and finite fields are of great importance in modern applications such as in the analysis of algorithms, in information and communication theory, and in signal processing and coding theory.
Discover the Connections between Different Structures and FieldsDiscrete Structures and Their Interactions highlights the connections among various discrete structures, including graphs, directed graphs, hypergraphs, partial orders, finite topologies, and simplicial complexes.
This book contains the proceedings of the 19th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, held during June 20-22, 2023, in Garmisch-Partenkirchen, Germany.
This book contains the proceedings of the 19th Cologne-Twente Workshop on Graphs and Combinatorial Optimization, held during June 20-22, 2023, in Garmisch-Partenkirchen, Germany.
This book treats the elements of discrete mathematics that have important applications in computer science, thus providing the necessary tools for the reader to come to a competent mathematical judgement of modern developments in the age of information.
Bringing the material up to date to reflect modern applications, this second edition has been completely rewritten and reorganized to incorporate a new style, methodology, and presentation.
Cryptography, in particular public-key cryptography, has emerged in the last 20 years as an important discipline that is not only the subject of an enormous amount of research, but provides the foundation for information security in many applications.
Elwyn Berlekamp, John Conway, and Richard Guy wrote 'Winning Ways for your Mathematical Plays' and turned a recreational mathematics topic into a full mathematical fi eld.
This proceedings volume convenes selected, revised papers presented at the 52nd Southeastern International Conference on Combinatorics, Graph Theory and Computing (SEICCGTC 2021), virtually held at Florida Atlantic University in Boca Raton, USA, on March 8-12, 2021.
Books on information theory and coding have proliferated over the last few years, but few succeed in covering the fundamentals without losing students in mathematical abstraction.
This book, for a first undergraduate course in Discrete Mathematics, systematically exploits the relationship between discrete mathematics and computer programming.
This original research monograph concerns various aspects of how (based on the decompositions of vertices of hypercube graphs with respect to their symmetric cycles) the vertex sets of related discrete hypercubes, as well as the power sets of the corresponding ground sets, emerge from rank 2 oriented matroids, from underlying rank 2 systems of linear inequalities, and thus literally from arrangements of straight lines crossing a common point on a piece of paper.
This original research monograph concerns various aspects of how (based on the decompositions of vertices of hypercube graphs with respect to their symmetric cycles) the vertex sets of related discrete hypercubes, as well as the power sets of the corresponding ground sets, emerge from rank 2 oriented matroids, from underlying rank 2 systems of linear inequalities, and thus literally from arrangements of straight lines crossing a common point on a piece of paper.
This volume comprises 17 contributions that present advanced topics in graph domination, featuring open problems, modern techniques, and recent results.
The International Conference on Complex Networks (CompleNet) brings together researchers and practitioners from diverse disciplines working on areas related to complex networks.
This proceedings volume convenes selected, revised papers presented at the 52nd Southeastern International Conference on Combinatorics, Graph Theory and Computing (SEICCGTC 2021), virtually held at Florida Atlantic University in Boca Raton, USA, on March 8-12, 2021.
This book contains contributions in the area of Network Science, presented at the 14th International Conference on Complex Networks (CompleNet), 24-28 April, 2023 in Aveiro, Portugal.
