Author:
Frederickson Greg N.,Ja'ja' Joseph
Subject
General Computer Science,Theoretical Computer Science
Reference22 articles.
1. Every planar map is four colorable, Part I: Discharging;Appel;Illinois J. Math.,1977
2. Every planar map is four colorable, Part II: Reducibility;Appel;Illinois J. Math.,1977
3. Dynamic programming treatment of the travelling salesman problem;Bellman;J. ACM,1962
4. Finding minimum spanning trees;Cheriton;SIAM J. Comput.,1976
5. Worst-case analysis of a new heuristic for the travelling salesman problem;Christofides,1976
Cited by
65 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献