Author:
Chang Maw-Shang,Hung Ling-Ju,Kloks Ton,Peng Sheng-Lung
Subject
General Computer Science,Theoretical Computer Science
Reference21 articles.
1. A. Berry, M.C. Golumbic, M. Lipshteyn, Two tricks to triangulate chordal probe graphs in polynomial time, in: Proc. 15th ACM–SIAM Symposium on Discrete Algorithm, 2004, pp. 962–969.
2. A. Brandstädt, V.B. Le, J.P. Spinrad, Graph classes: a survey, in: SIAM Monographs on Discrete Mathematics and Applications, Philadelphia, 1999.
3. Partitioned probe comparability graphs (in honor of Prof. Dr. J.H. van Lint);Chandler;Theoretical Computer Science,2008
4. On probe permutation graphs;Chandler;Discrete Applied Mathematics,2009
5. Dynamic programming on distance-hereditary graphs;Chang,1997
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献