Introduction to algorithms
Implementing discrete mathematics: combinatorics and graph theory with Mathematica
Implementing discrete mathematics: combinatorics and graph theory with Mathematica
The SetPlayer system for symbolic computation on power sets
Journal of Symbolic Computation
Tcl and the Tk toolkit
LEDA: a platform for combinatorial and geometric computing
Communications of the ACM
LINK: A Combinatorics and Graph Theory Workbench for Applications and Research
LINK: A Combinatorics and Graph Theory Workbench for Applications and Research
EVEGA: an educational visulalization environment for graph algorithms
Proceedings of the 6th annual conference on Innovation and technology in computer science education
Increasing engagement in automata theory with JFLAP
Proceedings of the 40th ACM technical symposium on Computer science education
Teaching discrete structures: a systematic review of the literature
Proceedings of the 42nd ACM technical symposium on Computer science education
Hi-index | 0.00 |
This paper introduces the LINK system as an educational tool which can be used to visualize and experiment with discrete algorithms. An extended example demonstrates the flexibility of the system in the context of a fundamental graph algorithm: finding the strongly connected components of a directed graph.