Author:
Jampani Krishnam Raju,Lubiw Anna
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Berry, A., Golumbic, M.C., Lipshteyn, M.: Two tricks to triangulate chordal probe graphs in polynomial time. In: SODA 2004: Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pp. 992–969 (2004)
2. Berry, A., Golumbic, M.C., Lipshteyn, M.: Recognizing chordal probe graphs and cycle-bicolorable graphs. SIAM J. Discret. Math. 21(3), 573–591 (2007)
3. Brass, P., Cenek, E., Duncan, C.A., Efrat, A., Erten, C., Ismailescu, D.P., Kobourov, S.G., Lubiw, A., Mitchell, J.S.B.: On simultaneous planar graph embeddings. Comput. Geom. Theory Appl. 36(2), 117–130 (2007)
4. Lecture Notes in Computer Science;D.B. Chandler,2006
5. Chandler, D.B., Chang, M.-S., Kloks, T., Liu, J., Peng, S.-L.: Partitioned probe comparability graphs. Theor. Comput. Sci. 396(1-3), 212–222 (2008)
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献