===What's New?=== First revision, Graph Board v.1.01 is now available. ===Overview=== The main objective of *graph_board* is to build a library for visualizing and working with graphs, that can help prototyping and testing graph theory related algorithms and that can also be used with education...

For a more up to date description, see http://jake.askeland.ws/ . TASPA began as a demonstration of a transitional vertex thinning algorithm based on convex polygon fitting. TASPA is limited to monochromatic pixel weights (either a pixel is 'passable' or 'impassible' and 'passable' pixels have...

_scala-graphs_ is a library that aims to provide a simple and flexible framework for working with graphs and graph algorithms in Scala. Graph theory is a branch of mathematics and computer science dealing with the study of graphs -- see http://en.wikipedia.org/wiki/Graph_theory *Status updat...

=SNAVI: Desktop Application for Analysis and Visualization of Large-Scale Cell Signaling Networks= http://amp.pharm.mssm.edu/snavi/snavi.png ==*Abstract*== Studies of cellular signaling indicate that signal transduction pathways combine to form large networks of interactions. Viewing protein-prot...

The frequency assignment problem is one of the most studied problems in graph theory, in particular, due to its applications to mobile telecommunication network design. Student will study and become familiar with various optimization techniques used for solving the problem, then he will implement a...