Author:
Crespelle Christophe,Perez Anthony,Todinca Ioan
Subject
Applied Mathematics,Discrete Mathematics and Combinatorics
Reference18 articles.
1. Computing common intervals of k permutations, with applications to modular decomposition of graphs;Bergeron,2005
2. NP-completeness results for edge modification problems;Burzyn;Discrete Appl. Math.,2006
3. Fully dynamic algorithm for recognition and modular decomposition of permutation graphs;Crespelle;Algorithmica,2010
4. An O(n2) time algorithm for the minimal permutation completion problem;Crespelle,2015
5. An O(n2)-time algorithm for the minimal interval completion problem;Crespelle;Theoret. Comput. Sci.,2013
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Linear-Time Minimal Cograph Editing;Fundamentals of Computation Theory;2021
2. A parallel algorithm for iterating partitions of a finite set into subsets of a given cardinality;Vestnik of Saint Petersburg University. Applied Mathematics. Computer Science. Control Processes;2020