This textbook describes the combinatorial analysis of data using trees as the model. It explores the applications of this technique in such fields as computer science, decision theory, artificial intelligence, information theory and the social sciences.
With examples of all 450 functions in action plus tutorial text on the mathematics, this book is the definitive guide to Experimenting with Combinatorica, a widely used software package for teaching and research in discrete mathematics. Three interesting classes of exercises are…
This book was first published in 2003. Combinatorica, an extension to the popular computer algebra system Mathematica®, is the most comprehensive software available for teaching and research applications of discrete mathematics, particularly combinatorics and graph theory. This …
With examples of all 450 functions in action plus tutorial text on the mathematics, this book is the definitive guide to Experimenting with Combinatorica, a widely used software package for teaching and research in discrete mathematics. Three interesting classes of exercises are…
"The main objective of this book is to develop a thorough understanding of the structure of graphs and the techniques used to analyze problems in graph theory. Fundamental graph algorithms are also included. Numerous examples, illustrations, and exercises guide readers through t…
This book describes how the spectral theory of finite graphs can be strengthened by exploiting properties of the eigenspaces of adjacency matrices associated with a graph. The extension of spectral techniques proceeds at three levels: using eigenvectors associated with an arbitr…
This book describes the spectral theory of finite graphs.
This book describes how the spectral theory of finite graphs can be strengthened by exploiting properties of the eigenspaces of adjacency matrices associated with a graph. The extension of spectral techniques proceeds at three levels: using eigenvectors associated with an arbitr…
This book describes how the spectral theory of finite graphs can be strengthened by exploiting properties of the eigenspaces of adjacency matrices associated with a graph. The extension of spectral techniques proceeds at three levels: using eigenvectors associated with an arbitr…
"An introductory text in graph theory, this treatment covers primary techniques and includes both algorithmic and theoretical problems. Algorithms are presented with a minimum of advanced data structures and programming details. This thoroughly corrected 1988 edition provides in…
"The main theme of this book is the interplay between the behaviour of a class of stochastic processes (random walks) and discrete structure theory. The author considers Markov chains whose state space is equipped with the structure of an infinite, locally-finite graph, or as a …
This volume contains six keynote lectures and 44 contributed papers of the TI 2009 conference that was held in Saint-Luce, La Martinique, May 31-June 5, 2009. These lectures address the latest developments in direct numerical simulations, large eddy simulations, compressible tur…