No label defined (Q3140399)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 437527
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | No label defined |
scientific article; zbMATH DE number 437527 |
Statements
13 February 1995
0 references
Stanford GraphBase
0 references
combinatorial algorithms
0 references
0.8940833210945129
0 references
0.7588594555854797
0 references
The Stanford GraphBase is a freely available collection of computer programs and data useful for testing and comparing combinatorial algorithms. The programs generate a large number of graphs with a great variety of properties. Some of the graphs are based on data from the ``real world'': Five-letter words of English, the characters in classical works of fiction, highway distances between cities, input-output statistics of the US economy, college football scores, computational logic circuits, the Mona Lisa, etc. Others are based on regular mathematical constructions such as lattices and quaternions. Graphs can be modified and combined by union, intersection, complementation, product, and forming line graphs. A general induced-graph routine allows omission and/or collapsing and/or splitting of vertices, and/or replacement of vertices by arbitrary graphs. Each graph has an identifying name, so that researchers all over the world can compare results on identical graphs and so that experiments are reproducible. For example, graphs such as book (``homer'', 280, 0, 1, 0, 0, 1, 1, 0) and random\_bigraph (128, 128, 1000, \(-1\), 0, 0, 0, 0, 314159) and all-perms (9) are well defined. Conclusion: This paper is a brief overview of the system. Complete details appeared in the author's book with the same title, published by ACM Press in 1993. For the entire collection see [Zbl 0771.00043].
0 references