Publisher
Springer Science and Business Media LLC
Subject
Computational Mathematics,Computational Theory and Mathematics,Computer Science Applications,Numerical Analysis,Theoretical Computer Science,Software
Reference13 articles.
1. Unger, S. H.: GIT — A heuristic program for testing pairs of directed line graphs for isomorphism. Comm. ACM7, 26–34 (1964).
2. Böhm, C., and A. Santolini: A quasi-decision algorithm for thep-equivalence of two matrices. ICC Bull.3, 57–69 (1964).
3. Proc. AFIPS 1964 SJCC;G. Salton,1964
4. Sussenguth, E. H., Jr.: A graph-theoretical algorithm for matching chemical structures. J. Chem. Doc.5, 36–43 (1965).
5. Hopcroft, J., and R. Tarjan: Planarity testing inV logV steps: extended abstract. Proc. IFIP Congress 1971, Booklet TA-2, pp. 18–22 (1971).
Cited by
12 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Theoretical Computer Science in Italy: The Early Years;IEEE Annals of the History of Computing;2021-07-01
2. Graph Isomorphism;Texts in Computer Science;2021
3. Changes in rat's meal patterns as a function of the caloric density of the diet;Physiology & Behavior;1986-01
4. Graph isomorphism problem;Journal of Soviet Mathematics;1985-05
5. Introduction;Graphs and Order;1985