The Graph Database
- Purspose: To provide standard test ground for benchmarking matching algorithims.
- The graphs have been randomly generated according to six different generation models, each involving different possible parameter settings. As a result, 84 diverse kinds of graphs are contained in the database. Each type is represented by thousands of pairs of graphs for which an isomorphism or a graph-subgraph isomorphism relation holds, for a total of 143,600 graphs.
- would have to fill dict's with our algorithms, but could use their graphs
- seems free and open but no license info
Pygr
- Pygr is an open source software project to develop graph database interfaces for the popular Python language, with a strong emphasis on bioinformatics applications ranging from genome-wide analysis of alternative splicing patterns, to comparative genomics queries of multi-genome alignment data. We have used Pygr successfully for many projects, but it is prerelease software!
* might be interesting example, but won't be using the same properties * open source
GRACE
[http://comad2005.persistent.co.in/COMAD2005Proc/pages138-147.pdf Paper]
- GRACE is a database management system for managing data that is in the form of labeled undirected graphs. GRACE introduces a new data model for graph data and a query language called Safari, which supports both attribute and structural searches. The users can add graphs to a database. The graphs can be retrieved based on their properties. The properties of a graph include the attributes associated with a graph and the structure of the graph.
* appears free and open, but no license info
Mathematica Graph Database Package
* No info on how many graphs or how they were generated * Query-able properties include: graph, order, edges,vertex connectivity, edge connectivity, diameter, girth, number of spanning trees, spectrum length, is simple, is connected, is bipartite, is planar, is regular, is eulerian, is hamiltonian, is tree, is biconnected, is complete, is perfect, is self-complementary
MAGMA Graph Database and Graph Generation
[http://magma.maths.usyd.edu.au/magma/htmlhelp/text1477.htm Link]
A catalogue of strongly regular graphs is available. This catalogue has been put together from various sources by B. McKay and can be found [http://cs.anu.edu.au/~bdm/data/ here]. Graphs in the database are indexed by a sequence of four parameters. They are, in order: the order of the graph, its degree, the number of common neighbours to each pair of adjacent vertices, and the number of common neighbours to each pair of non-adjacent vertices. === Then from http://cs.anu.edu.au/~bdm/data/ (link from MAGMA) ===
Simple, Eulerian, Strongly Regular, Ramsey, Hypohamilitonian, Planar
Combinatorial Catalogues
These are also organized by type, and also (similar to MAGMA) in BD McKay’s graph6 and sparse6 format. Nauty handles this format, but there is also an open source (no visible copyright or license) C program called readg available at this site. It gives a couple of text format options: list, adj matrix, edge list.
- Here are the headings from Gordon Royle’s database:
- * Small graphs
- * Small multigraphs
- * Cubic graphs
- * Symmetric cubic graphs (Foster Census)
- * Vertex-transitive graphs
- * Cayley graphs (by group)
- * Vertex-transitive cubic graphs
- * Cubic Cages and higher valency cages
- * Planar graphs
- * Cubic Planar graphs (drawings!)
- * Strongly regular graphs (parameters)
- * Self-Complementary Graphs
- * Constructions of Certain Graphs
Graph Database
- Web application, query by property
- will list query results in table next to pictures of graphs, sorted by number of nodes
- can use to check properties
- 13,598 graphs in the database (run empty query)
- free, but closed source