Author:
Akutsu Tatsuya,Tamura Takeyuki
Publisher
Springer Berlin Heidelberg
Reference22 articles.
1. Abu-Khzam, F.N., Samatova, N.F., Rizk, M.A., Langston, M.A.: The maximum common subgraph problem: faster solutions via vertex cover. In: Proc. 2007 IEEE/ACS Int. Conf. Computer Systems and Applications, pp. 367–373. IEEE (2007)
2. Akutsu, T.: A polynomial time algorithm for finding a largest common subgraph of almost trees of bounded degree. IEICE Trans. Fundamentals E76-A, 1488–1493 (1993)
3. Lecture Notes in Computer Science;T. Akutsu,2012
4. Babai, L.: Luks. E. M.: Canonical labeling of graphs. In: Proc. 15th ACM Symp. Theory of Computing, pp. 171–183. ACM Press (1983)
5. Bachl, S., Brandenburg, F.-J., Gmach, D.: Computing and drawing isomorphic subgraphs. J. Graph Algorithms and Applications 8, 215–238 (2004)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献