Graphs and Discovery
American Mathematical Society (Verlag)
978-0-8218-3761-0 (ISBN)
This volume presents topics addressed at the working group meeting and workshop on Computer-generated Conjectures from Graph Theoretic and Chemical Databases held at Rutgers University (Piscataway, NJ). The events brought together theoreticians and practitioners working in graph theory and chemistry to share ideas and to set an agenda for future developments in the use of computers for generating scientific conjectures. Articles included in the volume were written by developers of some of the most important programs used around the world today. The disciplines represented include theoretical and applied computer science, statistics, discrete and non-discrete mathematics, chemistry, and information science. The book is suitable for researchers and students interested in the use of computers in graph theory.
Considerations for future designers of general purpose graph software by J. W. Berry Discovering optimization algorithms through automated learning by E. Breimer, M. Goldberg, D. Hollinger, and D. Lim Numbers of faces and boundary encodings of patches by G. Brinkmann, O. Delgado-Friedrichs, and U. von Nathusius Graph theoretical results obtained by the support of the expert system "graph"-An extended survey by D. Cvetkovic and S. Simic Graffiti.pc: A variant of graffiti by E. DeLaVina Some history of the development of graffiti by E. DeLaVina On some conjectures of Griggs and graffiti by E. DeLaVina, S. Fajtlowicz, and W. Waller On the representation and characterization of fullerene C$_{60}$ by S. Fajtlowicz The structure of fullerene signatures by J. E. Graver Catalog of all fullerenes with ten or more symmetries by J. E. Graver How far is, should and could be conjecture-making in graph theory an automated process? by P. Hansen What forms do interesting conjectures have in graph theory? by P. Hansen, M. Aouchiche, G. Caporossi, H. Melot, and D. Stevanovic Variable neighborhood search for extremal graphs. 9. Bounding the irregularity of a graph by P. Hansen and H. Melot Mathematics for the nanocell approach to molecular electronics by S. M. Husband, C. P. Husband, N. Dean, and J. M. Tour A software system for matroids by R. J. Kingan and S. R. Kingan A survey of research in automated mathematical conjecture-making by C. E. Larson Constrained generation of molecular graphs by R. Laue, T. Gruner, M. Meringer, and A. Kerber A dynamic programming approach for timing and designing clique algorithms by W. Myrvold, T. Prsa, and N. Walker On new didactics of mathematics: Learning graph theory via graffiti by R. D. Pepper Interactive conjecturing with Vega by T. Pisanski, M. Boben, and A. Zitnik On the $(1,2)$-spectral spread of fullerenes by D. Stevanovic and G. Caporossi.
| Erscheint lt. Verlag | 30.12.2005 |
|---|---|
| Reihe/Serie | Series in Discrete Mathematics & Theoretical Computer Science |
| Zusatzinfo | Illustrations |
| Verlagsort | Providence |
| Sprache | englisch |
| Gewicht | 840 g |
| Themenwelt | Mathematik / Informatik ► Mathematik ► Graphentheorie |
| ISBN-10 | 0-8218-3761-3 / 0821837613 |
| ISBN-13 | 978-0-8218-3761-0 / 9780821837610 |
| Zustand | Neuware |
| Haben Sie eine Frage zum Produkt? |
aus dem Bereich
