LINK: a system for graph computation

Software - Practice and Experience

Volumn 30, Issue 11, 2000, Pages 1285-1302

  Berry, J ^a   Dean, Nathaniel ^b   Goldberg, Mark K ^c   Shannon, Gregory E ^d   Skiena, Steven ^e  

^a Department of Computing Sciences ^*  (United States)

^b Rice University   (United States)

^c Department of Computer Science and Rensselaer Polytechnic Institute   (United States)

^d Ascend Communications   (United States)

^e Stony Brook University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; C (PROGRAMMING LANGUAGE); COMPUTER ARCHITECTURE; DATA STRUCTURES; DATABASE SYSTEMS; FILE EDITORS; GRAPHICAL USER INTERFACES; OBJECT ORIENTED PROGRAMMING; UNIX;

GRAPH ALGORITHMS; GRAPH EDITOR; GRAPH LIBRARY;

COMPUTER SOFTWARE;

EID: 0034273120     PISSN: 00380644     EISSN: None     Source Type: Journal    
DOI: 10.1002/1097-024X(200009)30:11<1285::AID-SPE340>3.0.CO;2-W     Document Type: Article

References (15)

1. Skiena S. Implementing Discrete Mathematics: Combinatorics and Graph Theory with Mathematica. Addison-Wesley, 1990.
2. Mevenkamp M, Dean N, Monma C. NETPAD user's guide and reference guide. 1990.
3. Berque D, Cecchini R, Goldberg M, Rivenburgh R. The setplayer system for symbolic computation on power sets. Journal of Symbolic Computation 1992; 14:645-662.
4. Shannon G, Meeden L, Friedman D. SchemeGraphs: An object-oriented environment for manipulating graphs, 1990. Software and documentation.
5. Ousterhout J. Tcl and the Tk Toolkit. Addison-Wesley, 1994.
6. Gallesio E. The stk reference manual. Technical Report RT 95-31a, I3S CNRS, Université de Nice, Sophia Antipolis, France, 1995.
7. Mehlhorn K, Nähger S. Leda: A platform for combinatorial and geometric computing. CACM 1995; 38(1):96-102.
8. Mäkinen E. How to draw a hypergraph. International Journal of Computer Mathematics 1990; 34:177-185.
9. McKay B. Nauty user's guide. Technical Report TR-CS-90-02, Australian National University, 1990.
10. Himsolt M. The graphlet system. Graph Drawing (Lecture Notes in Computer Science, vol. 1190). North S (ed.). 1996; 233-240.
11. Cherlin G, Latka B. A decision problem involving tournaments. Technical Report 96-11, Center for Discrete Mathematics and Theoretical Computer Science, 1996.
12. Latka B. Finitely constrained classes of homogeneous directed graphs. The Journal of Symbolic Logic 1994; 59(1):124-139.
13. Berry J, Dean N. Market basket analysis with LINK. Submitted to Congressus Numerantium, 1996.
14. Berry J. Improving discrete mathematics and algorithms curricula with LINK. SIGCSE/SIGCUE Conference on Integrating Technology into Computer Science Education, 1997; 14-20.
15. Berry J, Dean N, Fasel P, Goldberg M, Johnson E, MacCuish J, Shannon G, Skiena S. LINK: A combinatorics and graph theory workbench for applications and research. Technical Report 95-15, Center for Discrete Mathematics and Theoretical Computer Science (see also: http://dimacs.rutgers.edu), Piscataway, NJ, 1995.