Discrete mathematics

The range of random graph topics covered in this volume includes structure, colouring, algorithms, mappings, trees, network flows, and percolation.

Trees and Hills: Methodology for Maximizing Functions of Systems of Linear Relations

For the first time, this book unites different algebraic approaches for discrete optimization and operations research.

Among the participants discussing recent trends in their respective fields and in areas of common interest in these proceedings are such world-famous geometers as H.

The object of this book is to provide an account of the results and methods used in combinatorial theories: Graph Theory, Matching Theory, Hamiltonian Problems, Hypergraph Theory, Designs, Steiner Systems, Latin Squares, Coding Matroids, Complexity Theory.

Bonn Workshop on Combinatorial Optimization

This volume in the Annals of Discrete Mathematics brings together contributions by renowned researchers in combinatorics, graphs and complexity.

The Lukasiewicz-Moisil algebras were created by Moisil as an algebraic counterpart for the many-valued logics of Lukasiewicz.

The importance of submodular functions has been widely recognized in recent years in combinatorial optimization.

Combinatorics has not been an established branch of mathematics for very long: the last quarter of a century has seen an explosive growth in the subject.

Graph Colouring and Variations

Graph Theory and Applications

Recent developments in all aspects of combinatorial and incidence geometry are covered in this volume, including their links with the foundations of geometry, graph theory and algebraic structures, and the applications to coding theory and computer science.

This volume presents four machine-independent theories of computational complexity, which have been chosen for their intrinsic importance and practical relevance.

Linear and Combinatorial Optimization in Ordered Algebraic Structures

Combinatorial Mathematics, Optimal Designs, and Their Applications

Algorithmic Aspects of Combinatorics

The Nuts and Bolts of Proof instructs students on the basic logic of mathematical proofs, showing how and why proofs of mathematical statements work.

Handbook of Algebra

This book is intended to introduce researchers and graduate students to the concepts of causal symmetric spaces.

This title is the result of a one-week workshop sponsored by the Swedish research agency, FRN, on the interface between complexity and art.

Linear models, normally presented in a highly theoretical and mathematical style, are brought down to earth in this comprehensive textbook.

Computability, Complexity, and Languages is an introductory text that covers the key areas of computer science, including recursive function theory, formal languages, and automata.

Stochastic local search (SLS) algorithms are among the most prominent and successful techniques for solving computationally difficult problems in many areas of computer science and operations research, including propositional satisfiability, constraint satisfaction, routing, and scheduling.

In this book we generate graphic images using the software Mathematica thus providing a gentle and enjoyable introduction to this rather technical software and its graphic capabilities.

This book comes out of need and urgency (expressed especially in areas of Information Retrieval with respect to Image, Audio, Internet and Biology) to have a working tool to compare data.

This book explores a new, economically viable approach to pressure vessel design, included in the (harmonized) standard EN 13445 (for unfired pressure vessels) and based on linear as well as non-linear Finite Element analyses.