Publisher
Springer International Publishing
Reference17 articles.
1. DIMACS Series in Discrete Mathematics and Theoretical Computer Science;E Balas,1996
2. Cheng, Y., Wells, A.L.: Switching classes of directed graphs. J. Comb. Theory, Ser. B 40(2), 169–186 (1986).
http://www.sciencedirect.com/science/article/pii/0095895686900754
3. Cheriyan, J., Mehlhorn, K.: Algorithms for dense graphs and networks on the random access computer. Algorithmica 15(6), 521–549 (1996)
4. Dahlhaus, E., Gustedt, J., McConnell, R.M.: Partially complemented representations of digraphs. Discrete Math. Theor. Comput. Sci. 5(1), 147–168 (2002)
5. Edmonds, J.: Paths, trees, and flowers. Can. J. Math. 17, 449–467 (1965).
http://dx.doi.org/10.4153/CJM-1965-045-4
Cited by
1 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献