# How and How fast can we infer a logical formula that expresses a given graph in C$^2$( logic with 2 vars and counting quantifiers)?

In the following paper the author's claim that almost all graphs can be expressed in first order logic with counting quantifiers and two variables.

I would like to know, is there any algorithm that infers a C$$^2$$ representation of a graph ?

If there is then what is its time complexity ?

https://people.cs.umass.edu/~immerman/pub/canon.pdf