Nicht aus der Schweiz? Besuchen Sie lehmanns.de
Für diesen Artikel ist leider kein Bild verfügbar.

Trends in Discrete Mathematics

W. Deuber, H.J. Promel, B. Voigt (Herausgeber)

Buch | Hardcover
398 Seiten
1995
Elsevier Science Ltd (Verlag)
978-0-444-82192-8 (ISBN)
Preis auf Anfrage
  • Titel ist leider vergriffen;
    keine Neuauflage
  • Artikel merken
This volume represents the proceedings of a symposium, held in Bielefeld in 1992, and provides an overview of current and future trends in discrete mathematics. Aimed at a wide range of levels, topics discussed cover problems, results and aspects of discrete mathematics.
This volume has grown out of a symposium on "Trends in Discrete Mathematics" held in Bielefeld, 1992. The purpose of the symposium was to provide an overview on current and future trends in discrete mathematics. All contributions are by prominent researchers in their respective fields. The book constitutes a body of information on the many different aspects of discrete mathematics. This is a book that will appeal to non-experts as well as experts.

Realizability and uniqueness in graphs, M. Aigner and E. Triesch; an order theoretic framework for overlapping clustering, H.-J. Bandelt and A.W.M. Dress; search problems - one, two or many rounds, C.A. Christen; problems and results in discrete mathematics, P. Erd s; on additive properties of general sequences, P. Erd s et al; on the fractional dimension of partially ordered sets, S. Felsner and W.T. Trotter; recent trends in euclidean Ramsey theory, R.L. Graham; on the complexity of some basic problems in computational convexity - 1. containment problems, P. Gritzmann and V. Klee; probabilistically checkable proofs and their consequences for approximation algorithms, S. Hougardy et al; phase transition phenomena in random discrete structures, T. Luczak; the use of elementary substructures in combinatorics, E.C. Milner; some combinatorial-algebraic problems from complexity theory, P. Pudlak and V. Rodl; isometric embeddings and geometric designs, J.J. Seidel; from erdos to algorithms, J. Spencer; binomial identities - combinatorial and algorithmic aspects, V. Strehl; efficient data structures for Boolean functions, I. Wegener; the random cluster process, D.J.A. Welsh.

Erscheint lt. Verlag 31.3.1995
Reihe/Serie Topics in Discrete Mathematics ; v. 9
Zusatzinfo Illustrations
Verlagsort Oxford
Sprache englisch
Themenwelt Mathematik / Informatik Mathematik Angewandte Mathematik
Mathematik / Informatik Mathematik Graphentheorie
ISBN-10 0-444-82192-9 / 0444821929
ISBN-13 978-0-444-82192-8 / 9780444821928
Zustand Neuware
Haben Sie eine Frage zum Produkt?
Mehr entdecken
aus dem Bereich
Anwendungen und Theorie von Funktionen, Distributionen und Tensoren

von Michael Karbach

Buch | Softcover (2023)
De Gruyter Oldenbourg (Verlag)
CHF 97,90