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

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

Saved in:
Bibliographic Details
Date:2013
Main Authors: A. Polak, D. Simson
Format: Article
Language:English
Published: 2013
Series:Algebra and discrete mathematics
Online Access:http://jnas.nbuv.gov.ua/article/UJRN-0000090629
Tags: Add Tag
No Tags, Be the first to tag this record!
Journal Title:Library portal of National Academy of Sciences of Ukraine | LibNAS

Institution

Library portal of National Academy of Sciences of Ukraine | LibNAS
id open-sciencenbuvgovua-80607
record_format dspace
spelling open-sciencenbuvgovua-806072024-04-16T18:17:05Z Algorithms computing O(n, Z)-orbits of P-critical edge-bipartite graphs and P-critical unit forms using Maple and C# A. Polak D. Simson 1726-3255 2013 en Algebra and discrete mathematics http://jnas.nbuv.gov.ua/article/UJRN-0000090629 Article
institution Library portal of National Academy of Sciences of Ukraine | LibNAS
collection Open-Science
language English
series Algebra and discrete mathematics
spellingShingle Algebra and discrete mathematics
A. Polak
D. Simson
Algorithms computing O(n, Z)-orbits of P-critical edge-bipartite graphs and P-critical unit forms using Maple and C#
format Article
author A. Polak
D. Simson
author_facet A. Polak
D. Simson
author_sort A. Polak
title Algorithms computing O(n, Z)-orbits of P-critical edge-bipartite graphs and P-critical unit forms using Maple and C#
title_short Algorithms computing O(n, Z)-orbits of P-critical edge-bipartite graphs and P-critical unit forms using Maple and C#
title_full Algorithms computing O(n, Z)-orbits of P-critical edge-bipartite graphs and P-critical unit forms using Maple and C#
title_fullStr Algorithms computing O(n, Z)-orbits of P-critical edge-bipartite graphs and P-critical unit forms using Maple and C#
title_full_unstemmed Algorithms computing O(n, Z)-orbits of P-critical edge-bipartite graphs and P-critical unit forms using Maple and C#
title_sort algorithms computing o(n, z)-orbits of p-critical edge-bipartite graphs and p-critical unit forms using maple and c#
publishDate 2013
url http://jnas.nbuv.gov.ua/article/UJRN-0000090629
work_keys_str_mv AT apolak algorithmscomputingonzorbitsofpcriticaledgebipartitegraphsandpcriticalunitformsusingmapleandc
AT dsimson algorithmscomputingonzorbitsofpcriticaledgebipartitegraphsandpcriticalunitformsusingmapleandc
first_indexed 2025-07-22T09:08:52Z
last_indexed 2025-07-22T09:08:52Z
_version_ 1850419794919030784

Similar Items