Author:
Bergeron Anne,Chauve Cedric,de Montgolfier Fabien,Raffinot Mathieu
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. Lecture Notes in Bioinformatics;S. Bérard,2005
2. Bergeron, A., Chauve, C., de Montgolfier, F., Raffinot, M.: Computing common intervals of K permutations, with applications to modular decomposition of graphs. LIAFA technical report 2005-006, available at: http://www.liafa.jussieu.fr/web9/rapportrech/listrapport_fr.php?anscol=2005
3. Booth, S., Lueker, G.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-trees algorithms. J. Comput. Syst. Sci. 13, 335–379 (1976)
4. Bui Xuan, B.M., Habib, M., Paul, C.: From Permutations to Graph Algorithms, LIRMM technical report RR-05021 (2005)
5. Capelle, C., Habib, M.: Graph decompositions and factorizing permutations. In: Fifth Israel Symposium on Theory of Computing and Systems, ISTCS 1997, pp. 132–143. IEEE Computer Society Press, Los Alamitos (1997)
Cited by
19 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献