The Open Graph Archive: A Community-Driven Effort

@inproceedings{Bachmaier2011TheOG,
  title={The Open Graph Archive: A Community-Driven Effort},
  author={Christian Bachmaier and Franz-Josef Brandenburg and Philip Effinger and Carsten Gutwenger and Jyrki Katajainen and Karsten Klein and Miro Sp{\"o}nemann and Matthias Stegmaier and Michael Wybrow},
  booktitle={GD},
  year={2011}
}
A graphbase, a term coined by Knuth [7], is a database of graphs and computer programs that generate, analyze, manipulate, and visualize graphs. The terms graphlibrary and grapharchive are often used as synonyms for this term. Our vision is to provide an infrastructure and quality standards for a public graphbase, named the Open Graph Archive, that is accessible to researchers and other interested parties around the world via the worldwide web. This paper describes the current work undertaken… 

The Graph Landscape: using visual analytics for graph set analysis

The Graph Landscape aims to support researchers to explore graphs and graph sets regarding their properties, to allow to select good experimental test sets, analyze newly generated sets, compare sets and assess the validity (or range) of experimental results and corresponding conclusions.

The Graph Landscape: a Concept for the Visual Analysis of Graph Set Properties

The Graph Landscape aims to support researchers to explore graphs and graph sets regarding their properties in order to allow to select good experimental test sets, analyze newly generated sets, compare sets and assess the validity (or range) of experimental results and corresponding conclusions.

Graph Layout Support for Model-Driven Engineering

A new meta model allowing to specify the structure of a graph as well as its abstract layout and its concrete layout is discussed, i.e. positioning data computed by the layout algorithm forms a basis for efficient management of layout configurations.

DAGmar : Library for DAGs ?

This work provides a highly configurable generator for creating random directed acyclic graphs and level graphs and a structured set of benchmark graphs.

Grid sifting: Leveling and crossing reduction

A combined leveling and crossing reduction algorithm based on sifting, which prioritizes few crossings over few levels, which avoids type 2 conflicts, which are crossings of edges whose endpoints are dummy vertices.

Algorithm Engineering im Graphenzeichnen

Anhand zweier Beispiele illustrieren wir die Anwendung von Algorithm Engineering im Bereich des automatischen Zeichnens von Graphen. Zunächst berichten wir über die Planarisierungsmethode und

A Bibliography of Papers in Lecture Notes in Computer Science (2012): Volumes 6121{7125

(∆ + 1) [1577]. (ρ,G) [266]. (r|p) [781]. 1 [1022]. 1 [1342]. 2 [27, 1294, 1138, 432, 1028, 281, 758, 272, 1440, 546, 861, 867, 1352, 578, 561]. 3 [579, 1293, 1381, 176, 1355, 1623, 1294, 1012, 1358,

Minority student involvement in computational science research at Texas Southern University

Recommendations are broadly applicable to under-privileged students or to students in educational institutions that have very limited resources and support for computational science.

References

SHOWING 1-10 OF 18 REFERENCES

An Experimental Comparison of Four Graph Drawing Algorithms

Matrix Market: a web resource for test matrix collections

A repository of data for the testing of numerical algorithms and mathematical software for matrix computations designed to accommodate both dense and sparse matrices, as well as software to generate matrices.

Large-Graph Layout Algorithms at Work: An Experimental Study

This paper investigates some of these methods that are based on force-directed or algebraic approaches in terms of running time and drawing quality on a big variety of artificial and real-world graphs.

Drawing Directed Acyclic Graphs: An Experimental Study

This study is conducted on two large test suites of DAGs and yields more than 30 charts comparing the performance of the drawing algorithms with respect to several quality measures, including area, crossings, bends, and aspect ratio.

The Stanford GraphBase - a platform for combinatorial computing

Part 1: overview - Words, Roget, Books, Econ, Games, Miles, Plane, Lisa, Raman, Gates, Rand, Basic, Save technicalities, and how to obtain the files and use the graphbase and makefile details.

A Combined Evolutionary Search and Multilevel Optimisation Approach to Graph-Partitioning

An evolutionary search algorithm for finding benchmark partitions using a multilevel heuristic algorithm to provide an effective crossover and it is demonstrated that this method can achieve extremely high quality partitions significantly better than those found by the state-of-the-art graph-partitioning packages.

The university of Florida sparse matrix collection

The University of Florida Sparse Matrix Collection, a large and actively growing set of sparse matrices that arise in real applications, is described and a new multilevel coarsening scheme is proposed to facilitate this task.

GraphArchive - An Online Graph Data Store

Konzeption und Realisierung einer Graphenbibliothek zur Evaluierung von Visualisierungsmethoden für Graphen

  • Konzeption und Realisierung einer Graphenbibliothek zur Evaluierung von Visualisierungsmethoden für Graphen
  • 2011

76 of IFIP Conference Series

  • 76 of IFIP Conference Series
  • 1997