A note on the graph isomorphism counting problem
- 1 March 1979
- journal article
- Published by Elsevier in Information Processing Letters
- Vol. 8 (3) , 131-136
- https://doi.org/10.1016/0020-0190(79)90004-8
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- The complexity of finding fixed-radius near neighborsInformation Processing Letters, 1977
- Location of a Point in a Planar Subdivision and Its ApplicationsSIAM Journal on Computing, 1977
- Finding nearest neighboursInformation Processing Letters, 1976
- Multidimensional Searching ProblemsSIAM Journal on Computing, 1976
- Geometric complexityPublished by Association for Computing Machinery (ACM) ,1975