Author:
Cannon Sarah,Ishaque Mashhood,Tóth Csaba D.
Publisher
Springer Berlin Heidelberg
Reference15 articles.
1. Ahuja, R.K., Magnanti, T.L., Orlin, J.B.: Network Flows: Theory, Algorithms, and Applications. Prentice Hall (February 1993)
2. Arora, S., Barak, B.: Computational Complexity: A Modern Approach. Cambridge Univ. Press (2009)
3. Cannon, S., Ishaque, M., Tóth, C.D.: Conflict-free graph orientations with parity and degree constraints, arXiv:1203.3256 (2012) (manuscript)
4. Darmann, A., Pferschy, U., Schauer, J., Woeginger, G.J.: Paths, trees, and matchings under disjunctive constraints. Discrete Appl. Math. 159(16), 1726–1735 (2011)
5. Felsner, S., Fusy, É., Noy, M.: Asymptotic enumeration of orientations. Discrete Math. Theor. Comp. Sci. 12(2), 249–262 (2010)
Cited by
2 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献