> > > A group of people here at my UNI wants to start creating databases storing > interesting graphs and some of their (non-trivial to compute) invariants. > The idea is to then make them available through optional Sage spkg's. > > Our aim is to start with cubic vertex transitive graphs which were > classified up to ~1k vertices, see > http://www.matapp.unimib.it/~spiga/census.html > > We were thinking of using the graph database framework > http://doc.sagemath.org/html/en/reference/graphs/sage/graphs/graph_database.html > > but since this was not poked for a long time I am wondering: > > - Is there any other method that you'd suggest for keeping such > classifications? > - Do you have any other constructive comments/requests before we start > designing such thing? > > Forwarding to (one of) the original creator(s) of the graph database in case he has some wisdom.
-- You received this message because you are subscribed to the Google Groups "sage-devel" group. To unsubscribe from this group and stop receiving emails from it, send an email to sage-devel+unsubscr...@googlegroups.com. To post to this group, send email to sage-devel@googlegroups.com. Visit this group at http://groups.google.com/group/sage-devel. For more options, visit https://groups.google.com/d/optout.
