Author:
Chandler David B.,Chang Maw-Shang,Kloks Antonius J. J.,Liu Jiping,Peng Sheng-Lung
Publisher
Springer Berlin Heidelberg
Reference24 articles.
1. Berry, A., Golumbic, M.C., Lipshteyn, M.: Two tricks to triangulate chordal probe graphs in polynomial time. In: Proceedings of the 15th. In: ACM-SIAM Symposium on Discrete Algorithms, pp. 962–969 (2004)
2. Bodlaender, H., Kloks, T., Kratsch, D.: Treewidth and Pathwidth of permutation graphs. SIAM Journal on Discrete Mathematics 8, 606–616 (1995)
3. Booth, K.S., Lueker, G.S.: Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms. Journal of Computer and System Sciences 13, 335–379 (1976)
4. Bouchitte, V., Todinca, I.: Treewidth and minimum fill-in: Grouping the minimal separators. SIAM Journal on Computing 31, 212–232 (2001)
5. Lecture Notes in Computer Science;M.-S. Chang,2005
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献