Remote Access Mathematics of Computation
Green Open Access

Mathematics of Computation

ISSN 1088-6842(online) ISSN 0025-5718(print)

 

 

Generating the nine-point graphs


Authors: H. H. Baker, A. K. Dewdney and A. L. Szilard
Journal: Math. Comp. 28 (1974), 833-838
MSC: Primary 68A05
MathSciNet review: 0371134
Full-text PDF Free Access

Abstract | References | Similar Articles | Additional Information

Abstract: A program has been written which recently generated all the (unlabelled) nine-point graphs. Written in MACRO-10 assembly language and run on a 165K PDP-10, it generates the complete set of 274,668 graphs in less than six hours. The algorithm on which this program is based is discussed with an emphasis on coding of graphs and various programming techniques designed to save space and time during execution. The methods developed may have applications in other combinatorial generating problems.


References [Enhancements On Off] (What's this?)


Similar Articles

Retrieve articles in Mathematics of Computation with MSC: 68A05

Retrieve articles in all journals with MSC: 68A05


Additional Information

DOI: https://doi.org/10.1090/S0025-5718-1974-0371134-8
Keywords: Graph, generative enumeration, graph isomorphism, filter, preliminary code, filtered code, maximal code
Article copyright: © Copyright 1974 American Mathematical Society