Algorithms computing O(n, Z)-orbits of P-critical edge-bipartite graphs and P-critical unit forms using Maple and C# / Polak, A., Simson, D. (2013)
UkrainianEnglish

web address of the page http://jnas.nbuv.gov.ua/article/UJRN-0000090629
  Algebra and discrete mathematics      А - 2019  /     Issue (2013, Vol. 16, № 2)

Polak A., Simson D.
Algorithms computing O(n, Z)-orbits of P-critical edge-bipartite graphs and P-critical unit forms using Maple and C#

Cite:
Polak, A., Simson, D. (2013). Algorithms computing O(n, Z)-orbits of P-critical edge-bipartite graphs and P-critical unit forms using Maple and C#. Algebra and discrete mathematics, 16 (2), 242-286. http://jnas.nbuv.gov.ua/article/UJRN-0000090629

 

Institute of Information Technologies of VNLU

+38 (044) 525-36-24
libnas@nbuv.gov.ua
Ukraine, 03039, Kyiv, Holosiivskyi Ave, 3, room 209