## Computational Support for Discrete Mathematics: DIMACS Workshop, March 12-14, 1992With 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. |

### What people are saying - Write a review

We haven't found any reviews in the usual places.

### Contents

A Visualization Tool for Graph Algorithms | 17 |

Applicaiton of Computational Tools for Finitely Presented Groups | 29 |

Animated Algorithms Computer Science Education with Algorithm | 41 |

An Animated Graph Environment | 57 |

An Interactive Graphical Educationally Oriented Graph Analysis Package | 71 |

Computing Spanning Trees in NETPAD | 85 |

An Empirical Assessment of Algorithms for Constructing a Minimum | 99 |

Rectilinear Steiner Tree Minimization on a Workstation | 119 |

GMPX An XWindows Based Graph Manipluation Package | 245 |

A System for Network Analysis | 255 |

A Tool for Interactive Design and Manipulation of Graphs | 269 |

A System to Manipulate Graphs and Digraphs | 279 |

Extending a Graph Browser for Topological Graph Theory | 297 |

Test Case Construction for the Vertex Cover Problem | 315 |

Software for Combinatorics | 327 |

Formal Calculus and Enumerative Combinatorics | 335 |

The XYZ GeoBench for the Experimental Evaluation of Geometric | 137 |

Monitoring an Algorithms Execution | 153 |

Implementation of Parallel Graph Algorithms on the MasPar | 165 |

Monte Carlo and Markov Chain Techniques for Network Reliability | 199 |

Networks and Reliability in Maple | 223 |

Implementing Finite State Machines | 347 |

A Tool for Visualizing and Simulating Nondeterministic Pushdown | 365 |

Recognizing the Hidden Structure of Cayley Graphs | 379 |

A Concept for the Representation of Data and Algorithms | 391 |

### Other editions - View all

Computational Support for Discrete Mathematics: DIMACS Workshop, March 12-14 ... Nathaniel Dean No preview available - 1994 |

### Common terms and phrases

algorithm animation application approximation automata automaton Beatty sequences binary heaps Bonsai button combinatorial command complete components configurations constructed coset enumeration created data structures defined deleted described developed display E-mail address edges efficient example execute Fibonacci heaps Figure finitely presented function GeoBench global memory graph algorithms graph theory GraphPack GraphTool heaps heuristic implemented input integer sequence interactive Kruskal's algorithm label language linear lower bound machine manipulation Maple Markov chain MasPar Mathematica menu METANET method minimum spanning minimum spanning tree NETPAD node NPDA objects operations package pairing heaps parallel parameters PE's percent-done polynomial polyominoes PRAM Prim's algorithm priority queue problem provides random graphs recurrence reliability representation rotation system routines running Section server spanning trees Steiner tree subgraphs symbolic technique Theoretical Computer Science tool user interface vertex cover vertex cover problem vertices window workstation