%0 Journal Article
%A R. A. Petrovich
%T Relaxation of the famous $NP$-complete polar graphs recognition problem leading to the fast polynomial-time algorithm
%J Trudy Instituta matematiki
%D 2012
%P 74-82
%V 20
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/item/TIMB_2012_20_1_a7/
%G ru
%F TIMB_2012_20_1_a7