REFERENCES
1. R. Agu, H. Nghiem, J. Rebaza. Grouping problem in networks. Technical Report Universität Kaiserlautern, Technomathematik (1994).
2. R. Andersen, Y. Peres. Finding sparse cuts locally using evolving sets. Proceedings of 41 ACM Symposium on Theory of Computing (2009), 235–244.
3. P. Berkhin. Bookmark-coloring algorithm for personalized PageRank computing. Internet Mathematics 3 (2005), 41–62.
4. A. Berman, R. Plemmons. Nonnegative Matrices in the Mathematical Sciences. Classics in Applied Mathematics, SIAM (1994).
5. M. Berry, Z. Drmac, E. Jessup. Matrices, vector spaces and information retrieval. SIAM Review 41 (1999), 335–362.
6. W.J. Beyn. The numerical computation of connecting orbits in dynamical systems. IMA J. of Numerical Analysis 9 (1990), 379–405.
7. W. Beyn. On well-posed problems for connecting orbits in dynamical systems. Contemporary Mathematics 172 (1994), 131–168.
8. J. Bohn, J. Rebaza, K. Speer. Continuous threshold prey harvesting in predator–prey models. Int. J. of Computational and Mathematical Sciences 5 (2011), 111–118.
9. W. Boyce, R. Di Prima. Elementary Differential Equations and Boundary Value Problems. Wiley (2009).
10. F. Brauer, J. Nohel. The Qualitative Theory of Ordinary Differential Equations, an Introduction. Dover Publications (1989).
11. S. Brin, L. Page, T. Winograd. The PageRank citation ranking: bringing order to the web. Technical Report 1999–0120, Stanford University (1999).
12. J. Carreño, T. Lara, J. Rebaza. On a model of American ...
Get A First Course in Applied Mathematics now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
