AMS eBook CollectionsOne of the world's most respected mathematical collections, available in digital format for your library or institution
Computational Support for Discrete Mathematics
About this Title
Nathaniel Dean and Gregory E. Shannon, Editors
Publication: DIMACS Series in Discrete Mathematics and Theoretical Computer Science
Publication Year:
1994; Volume 15
ISBNs: 978-0-8218-6605-4 (print); 978-1-4704-3973-6 (online)
DOI: https://doi.org/10.1090/dimacs/015
MathSciNet review: MR1281810
MSC: Primary 05-06; Secondary 00B25
ReadershipTable of Contents
Front/Back Matter
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 X-Windows 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