Before revision: There is a trivial  (n^3{T})  algorithm for approximate triangle counting where T is the number of triangles in the graph and n the number of vertices.
After revision: There is a trivial O (n^3{T}) algorithm for approximate triangle counting where T is the number of triangles in the graph and n the number of vertices.