Author:
Ergun Özlem,Kuyzu Gültekin,Savelsbergh Martin
Subject
Management Science and Operations Research,Modelling and Simulation,General Computer Science
Reference10 articles.
1. Arc routing problems, part 1: the Chinese postman problem;Eiselt;Operations Research,1995
2. On the complexity of finding a minimum cycle cover of a graph;Thomassen;SIAM Journal on Computing,1997
3. Covering the edges of a graph by circuits;Kesel’man;Kibernetica,1987
4. Covering graphs by simple circuits;Itai;SIAM Journal on Computing,1981
5. Shortest covering of graphs with cycles;Bermond;Journal of Combinatorial Theory, Series B,1983
Cited by
133 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献