Graph / General (Bibtex)

P340: Enumeration of all graphs in an almost sure first order fimiles
Input:
A first order language $\theta$.
Output:
All graphs in $\mathcal{G}_\theta$.
Complexity:
Polynomial space and delay.
Comment:
Reference:
[Goldberg1993b] (Bibtex)