Hardcover ISBN:  9780821866054 
Product Code:  DIMACS/15 
List Price:  $110.00 
MAA Member Price:  $99.00 
AMS Member Price:  $88.00 
eBook ISBN:  9781470439736 
Product Code:  DIMACS/15.E 
List Price:  $103.00 
MAA Member Price:  $92.70 
AMS Member Price:  $82.40 
Hardcover ISBN:  9780821866054 
eBook: ISBN:  9781470439736 
Product Code:  DIMACS/15.B 
List Price:  $213.00 $161.50 
MAA Member Price:  $191.70 $145.35 
AMS Member Price:  $170.40 $129.20 
Hardcover ISBN:  9780821866054 
Product Code:  DIMACS/15 
List Price:  $110.00 
MAA Member Price:  $99.00 
AMS Member Price:  $88.00 
eBook ISBN:  9781470439736 
Product Code:  DIMACS/15.E 
List Price:  $103.00 
MAA Member Price:  $92.70 
AMS Member Price:  $82.40 
Hardcover ISBN:  9780821866054 
eBook ISBN:  9781470439736 
Product Code:  DIMACS/15.B 
List Price:  $213.00 $161.50 
MAA Member Price:  $191.70 $145.35 
AMS Member Price:  $170.40 $129.20 

Book DetailsDIMACS  Series in Discrete Mathematics and Theoretical Computer ScienceVolume: 15; 1994; 399 ppMSC: Primary 68; Secondary 05;
With recent technological advances in workstations, graphics, graphical user interfaces, and object oriented programming languages, a significant number of researchers are developing generalpurpose 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.
Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were copublished with the Association for Computer Machinery (ACM).
ReadershipMathematicians and computer scientists.

Table of Contents

Chapters

Analyzing integer sequences

GDR: A visualization tool for graph algorithms

Application of computational tools for finitely presented groups

Animated algorithms computer science education with algorithm animation

AGE: An animated graph environment

An interactive, graphical, educationally oriented graph analysis package

Network assistant (to construct, test, and analyze graph and network algorithms)

Computing spanning trees in NETPAD

An empirical assessment of algorithms for constructing a miminum spanning tree

Rectilinear Steiner tree minimization on a workstation

The XYZ GeoBench for the experimental evaluation of geometric algorithms

Monitoring an algorithms’s execution

Implementation of parallel graph algorithms on the MasPar

Monte Carlo and Markov chain techniques for network reliability and sampling

Networks and reliability in Maple

GMP/X, an XWindows based graph manipulation package

METANET: A system for network analysis

GraphTool: A tool for interactive design and manipulation of graphs and graph algorithms

Improvements to GraphPack: A system to manipulate graphs and digraphs

Extending a graph browser for topological graph theory

Test case construction for the vertex cover problem

CalICo: Software for combinatorics

Formal calculus and enumerative combinatorics

Implementing finite state machines

NPDA: A tool for visualizing and simulating nondeterministic pushdown automata

Recognizing the hidden structure of Cayley graphs

A concept for the representation of data and algorithms


RequestsReview Copy – for publishers of book reviewsAccessibility – to request an alternate format of an AMS title
 Book Details
 Table of Contents
 Requests
With recent technological advances in workstations, graphics, graphical user interfaces, and object oriented programming languages, a significant number of researchers are developing generalpurpose 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.
Copublished with the Center for Discrete Mathematics and Theoretical Computer Science beginning with Volume 8. Volumes 1–7 were copublished with the Association for Computer Machinery (ACM).
Mathematicians and computer scientists.

Chapters

Analyzing integer sequences

GDR: A visualization tool for graph algorithms

Application of computational tools for finitely presented groups

Animated algorithms computer science education with algorithm animation

AGE: An animated graph environment

An interactive, graphical, educationally oriented graph analysis package

Network assistant (to construct, test, and analyze graph and network algorithms)

Computing spanning trees in NETPAD

An empirical assessment of algorithms for constructing a miminum spanning tree

Rectilinear Steiner tree minimization on a workstation

The XYZ GeoBench for the experimental evaluation of geometric algorithms

Monitoring an algorithms’s execution

Implementation of parallel graph algorithms on the MasPar

Monte Carlo and Markov chain techniques for network reliability and sampling

Networks and reliability in Maple

GMP/X, an XWindows based graph manipulation package

METANET: A system for network analysis

GraphTool: A tool for interactive design and manipulation of graphs and graph algorithms

Improvements to GraphPack: A system to manipulate graphs and digraphs

Extending a graph browser for topological graph theory

Test case construction for the vertex cover problem

CalICo: Software for combinatorics

Formal calculus and enumerative combinatorics

Implementing finite state machines

NPDA: A tool for visualizing and simulating nondeterministic pushdown automata

Recognizing the hidden structure of Cayley graphs

A concept for the representation of data and algorithms