default search action
DIMACS Workshop: Computational Support for Discrete Mathematics 1992
- Nathaniel Dean, Gregory E. Shannon:
Computational Support for Discrete Mathematics, Proceedings of a DIMACS Workshop, Piscataway, New Jersey, USA, March 12-14, 1992. DIMACS Series in Discrete Mathematics and Theoretical Computer Science 15, DIMACS/AMS 1994, ISBN 978-0-8218-6605-4 - Forward. Computational Support for Discrete Mathematics 1992: ix-
- Preface. Computational Support for Discrete Mathematics 1992: xi-
- Anil Bhansali, Steven Skiena:
Analyzing Integer Sequences. 1-16 - Matthias F. Stallmann, Rance Cleaveland, Prashant Hebbar:
GDR: A Visualization Tool for Graph Algorithms. 17-28 - George Havas, Edmund F. Robertson:
Application of Computational Tools for Finitely Presented Groups. 29-39 - Peter A. Gloor, Irene A. Lee, Angel Velez-Sosa:
Animated Algorithms Computer Science Education with Algorithm Animation. 41-55 - James Abello, Sandra Sudarsky, T. Veatch, J. Waller:
AGE: An Animated Graph Environment. 57-69 - David S. Dillon, Frank R. Smietana:
An Interactive, Graphical, Educationally Oriented Graph Analysis Package. 71-74 - Gordon H. Bradley, H. Fernandes Oliveira:
Network Assistant to Construct, Test, and Analyze Graph Network Algorithms. 75-84 - Keh-Wei Lih, Nathaniel Dean, Milena Mihail:
Computing Spanning Trees in NETPAD. 85-98 - Bernard M. E. Moret, Henry D. Shapiro:
An Empirical Assessment of Algorithms for Constructing a Minimum Spanning Tree. 99-117 - Clark D. Thomborson, Bowen Alpern, Larry Carter:
Rectilinear Steiner Tree Minimization on a Workstation. 119-136 - Peter Schorn:
The XYZ GeoBench for the Experimental Evaluation of Geometric. 137-151 - Dave A. Berque, Mark K. Goldberg:
Monitoring an Algorithm's Execution. 153-163 - Tsan-sheng Hsu, Vijaya Ramachandran, Nathaniel Dean:
Implementation of Parallel Graph Algorithms on the MasPar. 165-198 - Adam L. Buchsbaum, Milena Mihail:
Monte Carlo and Markov Chain Techniques for Network Reliability and Sampling. 199-222 - Daryl D. Harms, John S. Devitt, Charles J. Colbourn:
Networks and Reliability in Maple. 223-243 - Guy W. Zimmerman, Abdol-Hossein Esfahanian, David Vasquez:
GMP/X, An X-Windows Based Graph Manipulation Package. 245-254 - Claude Gomez, Maurice Goursat:
METANET: A System for Network Analysis. 255-268 - Vitus J. Leung, Michael B. Dillencourt, Andrew L. Bliss:
Graph Tool - A Tool for Interactive Design and Manipulation of Graphs and Graph Algorithms. 269-278 - Mukkai S. Krishnamoorthy, Alexander J. Suess, Mike Onghena, Ford Oxaal, Thomas Spencer:
Improvements to GraphPack: A System to Manipulate Graphs and Digraphs. 279-296 - Jonathan I. Helfman, Jonathan L. Gross:
Extending a Graph Browser for Topological Graph Theory. 297-314 - Laura A. Sanchis:
Test Case Construction for the Vertex Cover Problem. 315-326 - Maylis Delest, Nadine Rouillon:
CalICo: Software for Combinatorics. 327-333 - Maylis Delest:
Formal Calculus and Enumerative Combinatorics. 335-345 - Klaus Sutner:
Implementing Finite State Machines. 347-363 - Dan Caugherty, Susan H. Rodger:
NPDA: A Tool for Visualizing and Simulating Nondeterministic Pushdown Automata. 365-377 - Italo J. Dejter:
Recognizing the Hidden Structure of Cayley Graphs. 379-389 - Dirk Möller, Rudolf Müller:
A Concept for the Representation of Data and Algorithms. 391-399
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-22 19:30 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: