asa_graphs_2011


asa_graphs_2011, an Octave code which was used during labs, demonstrations, and lectures associated with the "Graph Algorithms" portion of the class "Algorithms for Science Applications II", as taught at the Scientific Computing Department, Florida State University, Spring Semester 2011.

The PDF versions of the documents are available as

Licensing:

The information on this web page is distributed under the MIT license.

Languages:

asa_graphs_2011 is available in a MATLAB version and an Octave version.

Related Data and Programs:

asa_geometry_2011, an Octave code which was used during labs, demonstrations and lectures for the "Geometry Algorithms" portion of the class "Algorithms for Science Applications II".

asa_images_2011, an Octave code which was used during labs, demonstrations and lectures for the "Image Algorithms" portion of the class "Algorithms for Science Applications II".

dijkstra, an Octave code which runs a simple example of Dijkstra's minimum distance algorithm for graphs.

graffiti, a dataset directory which contains 195 abstract graphs, with adjacency and embedding information, stored in the GRF format.

graph_representation, a data directory of examples which representing abstract mathematical graphs in various ways.

graph_representation, an Octave code which can express the representation of an abstract mathematical graph in several ways.

grf, a data directory which contains examples of GRF files, an abstract graph file format, 2D graphics;

grf_display, an Octave code which reads a GRF file defining a mathematical graph and displays it graphically.

grf_io, an Octave code which reads or writes a GRF file;

subset, an Octave code which enumerates combinations, partitions, subsets, index sets, trees, and other combinatorial objects.

Reference:

  1. Edsger Dijkstra,
    A note on two problems in connexion with graphs,
    Numerische Mathematik,
    Volume 1, 1959, pages 269-271.
  2. Peter Eades, Ian Fogg, David Kelly,
    SPREMB: A System for Developing Graph Algorithms,
    Congressus Numerantium,
    Volume 66, December 1988.
  3. Alan Gibbons,
    Algorithmic Graph Theory,
    Cambridge University Press, 1985,
    ISBN: 0-5212-8881-9,
    LC: QA166.G53.
  4. Joseph ORourke,
    Computational Geometry in C,
    Second Edition,
    Cambridge, 1998,
    ISBN: 0521649765,
    LC: QA448.D38.
  5. Stephen Skiena,
    Implementing Discrete Mathematics: Combinatorics and Graph Theory in Mathematica,
    Addison Wesley, 1990.
  6. Krishnaiyan Thulasiraman, M Swamy,
    Graphs: Theory and Algorithms,
    John Wiley, 1992,
    ISBN: 0471513563,
    LC: QA166.T58.

Source Code:


Last modified on 28 July 2011.