Polak, A., & Simson, D. (2018). Algorithms computing \({\rm O}(n, \mathbb{Z})\)-orbits of \(P\)-critical edge-bipartite graphs and \(P\)-critical unit forms using Maple and C\#. Lugansk National Taras Shevchenko University.
Chicago Style (17th ed.) CitationPolak, Agnieszka, and Daniel Simson. Algorithms Computing \({\rm O}(n, \mathbb{Z})\)-orbits of \(P\)-critical Edge-bipartite Graphs and \(P\)-critical Unit Forms Using Maple and C\#. Lugansk National Taras Shevchenko University, 2018.
MLA (8th ed.) CitationPolak, Agnieszka, and Daniel Simson. Algorithms Computing \({\rm O}(n, \mathbb{Z})\)-orbits of \(P\)-critical Edge-bipartite Graphs and \(P\)-critical Unit Forms Using Maple and C\#. Lugansk National Taras Shevchenko University, 2018.
Warning: These citations may not always be 100% accurate.