Publisher
Springer Berlin Heidelberg
Reference3 articles.
1. Leslie Ann Henderson. Efficient algorithms for listing unlabelled graphs. Technical Report CSR-7-90, University of Edinburgh, Department of Computer Science, 1990.
2. Lect Notes Comput Sci;C. Hoffmann,1981
3. Nicolas Peltier. A new method for automated finite model building exploiting failures and symmetries. Journal of Logic and Computation, 4(8):511–543, 1998.
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献