  A classical link in 3-space can be represented by a Gauss paragraph encoding
a link diagram in a combinatorial way. A Gauss paragraph may code not a
classical link diagram, but a diagram with virtual crossings. We present a
criterion and a linear algorithm detecting whether a Gauss paragraph encodes a
classical link. We describe Wirtinger presentations realizable by virtual link
groups.
