Subject
Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. A. Benczúr, J. Förster, Z. Király, Finding minimum generators for path systems of a cycle—implementation and analysis, 1998
2. Flows in Networks;Ford,1962
3. A. Frank, Finding minimum edge-coverings of pairs of sets, 1998
4. Finding minimum weighted generators of a path system;Frank,1999
5. Minimal edge-coverings of pairs of sets;Frank;J. Combin. Theory,1995
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献