Author:
Frank András,Szigeti Zoltán
Publisher
Springer Science and Business Media LLC
Subject
General Mathematics,Software
Reference7 articles.
1. A. Frank, “Packing paths, circuits, and cuts—a survey,” in: B. Korte, L. Lovász, H.-J. Prömel and A. Schrijver, eds.,Paths, Flows and VLSI-Layouts (Springer, Berlin, 1990) pp. 47–100.
2. M. Guan, “Graphic programming using odd and even points,”Chinese Journal of Mathematics 1 (1962) 273–277.
3. E. Korach and M. Penn, “Tight integral duality gap in the Chinese postman problem,”Mathematical Programming 55 (1992) 183–191.
4. M. Middendorf and F. Pfeiffer, “On the complexity of the edge-disjoint paths problem,”Combinatorica 13 (1) (1993) 97–108.
5. A. Sebő, “Undirected distances and the postman-structure of graphs,”Journal of Combinatorial Theory. Series B 49 (1) (1990) 10–39.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献