Kombinatorik & grafteori
Filter
The refereed proceedings of the 14th Annual Symposium on Combinatorial Pattern Matching, CPM 2003, held in Morelia, Michoacan, Mexico in June 2003.The 28 revised full papers …
Lattices are discrete subgroups of maximal rank in a Euclidean space. To each such geometrical object, we can attach a canonical sphere packing which, assuming some regularity, has …
The study of random graphs was begun by Paul Erdos and Alfred Renyi in the 1960s and now has a comprehensive literature. A compelling element has been the threshold function, a …
Dieses umfassende Lehrbuch über Kombinatorische Optimierung ist die deutsche Übersetzung der sechsten Auflage des Buches „Combinatorial Optimization – Theory and Algorithms". Es …
Shapes are complex objects to apprehend, as mathematical entities, in terms that also are suitable for computerized analysis and interpretation. This volume provides the background …
The concept of temporal networks is an extension of complex networks as a modeling framework to include information on when interactions between nodes happen. Many studies of the …
Semidefinite programs constitute one of the largest classes of optimization problems that can be solved with reasonable efficiency - both in theory and practice. They play a key …
This solid volume discusses all the key topics in detail, including classification, orbit structure, representations, universal constructions, and abstract analogues. Open problems …
This book constitutes the revised selected papers of the 37th International Workshop on Graph-Theoretic Concepts in Computer Science, WG 2011, held at Tepla Monastery, Czech …