%0 Journal Article
%A A. Polak
%A D. Simson
%T Algorithms computing ${\rm O}(n, \mathbb{Z})$-orbits of $P$-critical edge-bipartite graphs and $P$-critical unit forms using Maple and C\#
%J Algebra and discrete mathematics
%D 2013
%P 242-286
%V 16
%N 2
%I mathdoc
%U http://geodesic.mathdoc.fr/item/ADM_2013_16_2_a8/
%G en
%F ADM_2013_16_2_a8