Differences between revisions 24 and 25
Revision 24 as of 2007-06-14 02:40:29
Size: 1530
Editor: D-69-91-136-71
Revision 25 as of 2007-06-14 02:45:35
Size: 1584
Editor: D-69-91-136-71
Deletions are marked like this. Additions are marked like this.
Line 22: Line 22:
   * bipartite class - then check todo's in graph.py

Graph Theory

[:days4/projects/: Other SAGE Days 4 Project]

Participants: Emily Kirkman, Robert Miller, Craig Citro and David Roe

  • (done) Latex Graphs: Craig Citro & Robert Miller -- write an eps file to be included in LaTeX documents.

  • (done) NetworkX 1: Expose these in SAGE: centrality, cliques, cluster, cores, search -- These are pretty standard graph theoretic programs, and should not take too long to wrap.
  • NICE: The nauty clone for computing automorphism groups of graphs, and computing isomorphism. It has been converted to Pyrex, but it could still stand much optimization.
  • Electrical Networks, Jim Morrow's REU: Graphs with boundary are already in sage, but there are probably some useful constructions for Jim's summer REU that are not implemented yet. Especially data structures, perhaps an ElectricalNetworks class. Look at the Dirichlet problem, graphs on surfaces and (circular) planar embeddings of graphs.

  • Graph Database: Update interface to sqlite database of all graphs with 8 or fewer vertices.
  • [http://sage.math.washington.edu/home/rlmill/wshlst.pdf Wishlist] from Chris Godsil: It would be great if we could complete the list this week.

  • NetworkX 2:
    • spectrum -- This should probably not be wrapped, but instead mimicked, since sage's linear algebra is undoubtedly faster.
    • hybrid, threshold -- These seem to be specialized programs that are closely related to the research areas of the NetworkX authors. It is unclear what to do with these.
    • bipartite class - then check todo's in graph.py

days4/projects/graphs (last edited 2008-11-14 13:41:54 by localhost)