Kategoria BISAC: Mathematics >> Discrete Mathematics

This book constitutes the thoroughly refereed post-proceedings of the 30th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2004, held in Bad Honnef, Germany in June 2004.

The 31 revised full papers presented together with 2 invited papers were carefully selected from 66 submissions during two rounds of reviewing and improvement. The papers are organized in topical sections on graph algorithms: trees; graph algorithms: recognition and decomposition; graph algorithms: various problems; optimization and approximation algorithms; parameterized complexity and...

Proceedings of the 4th International Conference on Theory and Application of Diagrams, Stanford, CA, USA in June 2006. 13 revised full papers, 9 revised short papers, and 12 extended abstracts are presented together with 2 keynote papers and 2 tutorial papers. The papers are organized in topical sections on diagram comprehension by humans and machines, notations: history, design and formalization, diagrams and education, reasoning with diagrams by humans and machines, and psychological issues in comprehension, production and communication.

Combinatorial algebraic topology is a fascinating and dynamic field at the crossroads of algebraic topology and discrete mathematics. This volume is the first comprehensive treatment of the subject in book form. The first part of the book constitutes a swift walk through the main tools of algebraic topology, including Stiefel-Whitney characteristic classes, which are needed for the later parts. Readers - graduate students and working mathematicians alike - will probably find particularly useful the second part, which contains an in-depth discussion of the major research techniques of...

This book constitutes the refereed proceedings of the 5th International Workshop on Experimental and Efficient Algorithms, WEA 2006, held in Menorca, Spain, May 2006. The book presents 26 revised full papers together with 3 invited talks. The application areas addressed include most fields applying advanced algorithmic techniques, such as combinatorial optimization, approximation, graph theory, discrete mathematics, scheduling, searching, sorting, string matching, coding, networking, and more.

Un systeme dynamique discret est un ensemble fini d'elements, prenant chacun un nombre fini d'etats, et evoluant, dans un temps discret, par interactions mutuelles. Ce livre est consacre a l'analyse de la dynamique temporelle de tels systemes. Grace a des outils de metrique discrete, on etablit des resultats de convergence globale (contraction booleenne) convergence locale vers un point fixe ou vers un cycle, et ceci pour differents modes operatoires.

Graphs drawn on two-dimensional surfaces have always attracted researchers by their beauty and by the variety of difficult questions to which they give rise. The theory of such embedded graphs, which long seemed rather isolated, has witnessed the appearance of entirely unexpected new applications in recent decades, ranging from Galois theory to quantum gravity models, and has become a kind of a focus of a vast field of research. The book provides an accessible introduction to this new domain, including such topics as coverings of Riemann surfaces, the Galois group action on embedded graphs...