**DIMACS - Series in Discrete Mathematics and Theoretical Computer Science**

Volume: 15;
1994;
399 pp;
Hardcover

MSC: Primary 68;
Secondary 05

Print ISBN: 978-0-8218-6605-4

Product Code: DIMACS/15

List Price: $98.00

Individual Member Price: $78.40

**Electronic ISBN: 978-1-4704-3973-6
Product Code: DIMACS/15.E**

List Price: $98.00

Individual Member Price: $78.40

#### You may also like

# Computational Support for Discrete Mathematics

Share this page *Edited by *
*Nathaniel Dean; Gregory E. Shannon*

A co-publication of the AMS and DIMACS

With recent technological advances in workstations, graphics, graphical user interfaces, and object oriented programming languages, a significant number of researchers are developing general-purpose software and integrated software systems for domains in discrete mathematics, including graph theory, combinatorics, combinatorial optimization, and sets. This software aims to provide effective computational tools for research, applications prototyping, and teaching. In March 1992, DIMACS sponsored a workshop on Computational Support for Discrete Mathematics in order to facilitate interactions between the researchers, developers, and educators who work in these areas. Containing refereed papers based on talks presented at the workshop, this volume documents current and past research in these areas and should provide impetus for new interactions.

Co-published with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were co-published with the Association for Computer Machinery (ACM).

#### Readership

Mathematicians and computer scientists.

# Table of Contents

## Computational Support for Discrete Mathematics

- Cover Cover11
- Title page v6
- Contents vii8
- Foreword ix10
- Preface xi12
- Analyzing integer sequences 114
- GDR: A visualization tool for graph algorithms 1730
- Application of computational tools for finitely presented groups 2942
- Animated algorithms computer science education with algorithm animation 4154
- AGE: An animated graph environment 5770
- An interactive, graphical, educationally oriented graph analysis package 7184
- Network assistant (to construct, test, and analyze graph and network algorithms) 7588
- Computing spanning trees in NETPAD 8598
- An empirical assessment of algorithms for constructing a miminum spanning tree 99112
- Rectilinear Steiner tree minimization on a workstation 119132
- The XYZ GeoBench for the experimental evaluation of geometric algorithms 137150
- Monitoring an algorithms’s execution 153166
- Implementation of parallel graph algorithms on the MasPar 165178
- Monte Carlo and Markov chain techniques for network reliability and sampling 199212
- Networks and reliability in Maple 223236
- GMP/X, an X-Windows based graph manipulation package 245258
- METANET: A system for network analysis 255268
- GraphTool: A tool for interactive design and manipulation of graphs and graph algorithms 269282
- Improvements to GraphPack: A system to manipulate graphs and digraphs 279292
- Extending a graph browser for topological graph theory 297310
- Test case construction for the vertex cover problem 315328
- CalICo: Software for combinatorics 327340
- Formal calculus and enumerative combinatorics 335348
- Implementing finite state machines 347360
- NPDA: A tool for visualizing and simulating nondeterministic pushdown automata 365378
- Recognizing the hidden structure of Cayley graphs 379392
- A concept for the representation of data and algorithms 391404
- Back Cover Back Cover1413