Author:
Yamasaki Hitoshi,Shoudai Takayoshi
Publisher
Springer Berlin Heidelberg
Reference13 articles.
1. Angluin, D.: Finding patterns common to a set of strings. J. Comput. Syst. Sci. 21, 46–62 (1980)
2. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs and graph planarity using PQ-tree algorithms. J. Comput. Syst. Sci. 13, 335–379 (1976)
3. Gardi, F.: The mutual exclusion scheduling problem for proper interval graphs. LIF Research Report 02-2002, Laboratoire d’Informatique Fondamentale de Marseille (April 2002)
4. Hopcroft, J., Karp, R.: An n 5/2 algorithm for maximum matching in bipartite graphs. SIAM J. Comput. 2(3), 225–231 (1973)
5. Horváth, T., Ramon, J., Wrobel, S.: Frequent Subgraph Mining in Outerplanar Graphs. In: Proc. KDD 2006, pp. 197–206 (2006)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献