Isomorph-Free Exhaustive Generation
- 1 February 1998
- journal article
- Published by Elsevier in Journal of Algorithms
- Vol. 26 (2) , 306-324
- https://doi.org/10.1006/jagm.1997.0898
Abstract
No abstract availableKeywords
This publication has 20 references indexed in Scilit:
- A Constructive Enumeration of FullerenesJournal of Algorithms, 1997
- Generating rooted triangulations without repetitionsAlgorithmica, 1996
- Reverse search for enumerationDiscrete Applied Mathematics, 1996
- Correlations in two-dimensional vortex liquidsPhysical Review B, 1994
- There are 526,915,620 nonisomorphic one‐factorizations of K12Journal of Combinatorial Designs, 1994
- Sampling the Leaves of a Tree with Equal ProbabilitiesJournal of the American Statistical Association, 1993
- Efficient algorithms for listing unlabeled graphsJournal of Algorithms, 1992
- The value of the Ramsey numberr(3, 8)Journal of Graph Theory, 1992
- Cataloging graphs by generating them uniformly at randomJournal of Graph Theory, 1990
- 2000000 Steiner triple systems of order 19Mathematics of Computation, 1985