Publisher
Oxford University Press (OUP)
Reference37 articles.
1. Cormen T.H. , Leiserson C.E. , Rivest R.L. and Stein C. (2009) Introduction to Algorithms. MIT Press, Cambridge, MA, USA.
2. Paths, Trees, and Flowers
3. Micali S. and Vazirani V. (1980) An O(V1/2E) Algorithm for Finding Maximum Matching in General Graphs. In Proc. 21st Annual Symp. Foundations Comput. Sci., Syracuse, NY, USA, October 13–15, pp. 17–27. IEEE Computer Society, Washington, DC, USA.
4. Assortative Mixing in Networks
5. Local assortativeness in scale-free networks
Cited by
10 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献