Repository of Difficult Graph Experiments and Results (RODGER)

This webpage is the start of a set of results on networks that are difficult, but not impossible, to compute. We will update the website as we get more results and try to improve the format over time.

News

• 2016-06-12 Initial website posted with some graph eigenvalues.

Computational codes

• graph_eigs

Results

This is a placeholder until we can get something better setup!

Graph Eigenvalues

graph-eigs-v1.tar.gz

Sources

This will also be expanded shortly. These are just brief acknowledgements as to where the data came from at the moment

• Erdos02-cc - Pajek's Erdos sample file, largest connected component.
• as-caida20060911 - SNAP
• as19991115 - SNAP
• homo-cc - Gunnar W. Klau: A new graph-based method for pairwise global network alignment.
• marvel-chars-cc - Alberich http://arxiv.org/pdf/cond-mat/0202174.pdf
• marvel-comics-cc - Alberich http://arxiv.org/pdf/cond-mat/0202174.pdf
• musm-cc - Gunnar W. Klau: A new graph-based method for pairwise global network alignment.
• pgp-cc - Alex Arenas http://deim.urv.cat/~alexandre.arenas/data/welcome.htm
• yeast-cc - pajek