Contemporary Trends in Discrete Mathematics

From DIMACS and DIMATIA to the Future

AvAmerican Mathematical Society

Inbunden, Engelska, 1999

Del i serien DIMACS: Series in Discrete Mathematics and Theoretical Computer Science

1 452 kr

Beställningsvara. Skickas inom 5-8 vardagar. Fri frakt över 249 kr.

Beskrivning

Discrete mathematics stands among the leading disciplines of mathematics and theoretical computer science. This is due primarily to its increasing role in university curricula and its growing importance in applications ranging from optimization to molecular biology. An inaugural conference was held cooperatively by DIMATIA and DIMACS to focus on the versatility, width, and depth of current progress in the subject area. This volume offers a well-balanced blend of research and survey papers reflecting the exciting, attractive topics in contemporary discrete mathematics. Discussed in the book are topics such as graph theory, partially ordered sets, geometrical Ramsey theory, computational complexity issues and applications.

Produktinformation

Utgivningsdatum:1999-05-30
Vikt:936 g
Format:Inbunden
Språk:Engelska
Serie:DIMACS: Series in Discrete Mathematics and Theoretical Computer Science
Förlag:American Mathematical Society
ISBN:9780821809631

Utforska kategorier

Innehållsförteckning

Acyclic improper colourings of graphs with bounded degree by P. Boiron, E. Sopena, and L. Vignal Intersection graphs of Jordan arcs by P. Ossona de Mendez and H. de Fraysseix Linear and nonlinear systems: A survey by J. Diaz, M. Serna, and P. Spirakis Parameterized complexity: A framework for systematically confronting computational intractability by R. G. Downey, M. R. Fellows, and U. Stege On the structure of large homothetic subsets by G. Elekes The complexity of an inverse shortest paths problem by S. P. Fekete, W. Hochstattler, S. Kromberg, and C. Moll Finding minimum weighted generators of a path system by A. Frank On the distribution of sums of vectors in general position by J. R. Griggs and G. Rote The generalized matching problem on partial $k$-trees by A. Gupta, D. Kaller, S. Mahajan, and T. Shermer Bases of cocycle lattices and submatrices of a Hadamard matrix by W. Hochstattler and M. Loebl On the maximum lengths of Davenport-Schinzel sequences by M. Klazar On the minimum number of edges giving maximum oriented chromatic number by A. V. Kostochka, T. Luczak, G. Simonyi, and E. Sopena New trends in the theory of graph colorings: Choosability and list coloring by J. Kratochvil, Zs. Tuza, and M. Voigt Topological minors in graphs of minimum degree $n$ by W. Mader Reducible properties and uniquely partitionable graphs by P. Mihok Induced monochromatic subconfigurations by J. Nesetril, J. Solymosi, and P. Valtr Density by J. Nesetril and C. Tardif Spectra, graphs, and proteins. Towards understanding of protein folding by P. Pancoska, V. Janota, and J. Nesetril Meaningless statements by F. S. Roberts Graceful matchings in finite fields, the factor-difference sets of integers, and integers of the form $a^2 + kb^2$ by M. Rosenfeld How to solve a Turan type extremal graph problem? (Linear decomposition) by M. Simonovits Oriented list colouring of undirected graphs by A. Sali and G. Simonyi On the limit values of probabilities for the first order properties of graphs by J. Spencer and L. Thoma Ramsey theory and partially ordered sets by W. T. Trotter Generalizations of Davenport-Schinzel sequences by P. Valtr.