in a graph, is O(|E|*|V|) complexity considered polynomial or not?

Question

Sorry for stupid question. I cannot jog my memory and googling did not help me answer this question.

So basically given a graph G(V,E), I know that O(|V|^2) or O(|E|^2 + |V|^2) is considered to be polynomial complexity, so is O(|E|*|V|) polynomial as well? If not, what kind of complexity is it? I believe it's not pseudo-polynomial either.

Another question is: is O(m*n) considered polynomial as well, given m and n are the sizes of two INDEPENDENT inputs to a problem? I just want to clarify the concept of polynomial time in here and want to know if O(m*n) has a different name for its type of complexity.

Answer 1

它是多项式O（| V | ^ 3），因为边数是有界的O（| V | ^ 2）