Author:
Lee Orlando,Wakabayashi Yoshiko
Publisher
Springer Berlin Heidelberg
Reference16 articles.
1. B. Alspach, L. Goddyn, and C.Q. Zhang. Graphs with the circuit cover property. Trans. Am. Math. Soc., 344(1):131–154, 1994.
2. R.K. Ahuja, T.L. Magnanti, and J.B. Orlin. Network Flows: Theory, Algorithms and Applications. Prentice Hall, 1993.
3. E.M. Arkin and C.H. Papadimitriou. On the complexity of circulations. J. Algorithms, 7:134–145, 1986.
4. E.M. Arkin. Complexity of Cycle and Path Problems in Graphs. PhD thesis, Stanford University, 1986.
5. J.C. Bermond, B. Jackson, and F. Jaeger. Shortest coverings of graphs with cycles. J. Comb. Theory Ser. B, 35:297–308, 1983.
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On the Circuit Cover Problem
for Mixed Graphs;Combinatorics, Probability and Computing;2002-01