Author:
Lin Guohui,Chen Zhi-Zhong,Jiang Tao,Wen Jianjun
Subject
Applied Mathematics,Computational Theory and Mathematics,Computer Networks and Communications,Theoretical Computer Science
Reference25 articles.
1. Efficient algorithms for combinatorial problems on graphs with bounded decomposability;Arnborg;BIT,1985
2. V. Bafna, S. Muthukrishnan, R. Ravi, Computing similarity between RNA strings, in: Proceedings of the 6th Annual Symposium on Combinatorial Pattern Matching (CPM’95), Helsinki, Finland, Lecture Note in Computer Science, Vol. 937, 1995, pp. 1–16.
3. Approximation algorithms for NP-complete problems on planar graphs;Baker;J. ACM,1994
4. T.C. Biedl, P. Bose, E.D. Demaine, A. Lubiw, Efficient algorithms for Peterson's matching theorem, in: Proceedings of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA’99), Baltimore, MD, 1999, pp. 130–139.
5. On triangulating planar graphs under the four-connectivity constraint;Biedl;Algorithmica,1997
Cited by
39 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献