Author:
Frank András,Király Zoltán,Kotnyek Balázs
Subject
Applied Mathematics,Industrial and Manufacturing Engineering,Management Science and Operations Research,Software
Reference7 articles.
1. Edge-disjoint paths in planar graphs;Frank;J. Combin. Theory, Ser. B.,1985
2. Node-capacitated ring routing;Frank;Math. Oper. Res.,2002
3. Z. Király, An O(n2) algorithm for ring routing, Egres Technical Reports, TR-2005-10, see 〈http://www.cs.elte.hu/egres/〉, 2005.
4. Multicommodity flows in planar graphs;Okamura;J. Combin. Theory, Ser. B,1981
5. H. Ripphausen-Lipa, D. Wagner, K. Weihe, Survey on Efficient Algorithms for Disjoint Paths Problems in Planar Graphs, in: W. Cook, L. Lovász, P.D. Seymour (Eds.), DIMACS-Series in Discrete Mathematics and Theoretical Computer Science, vol. 20, On the Year of Combinatorial Optimization, American Mathematical Society, Providence, RI, 1995, pp. 295–354.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献