Suppose an algorithm $A$ which, given a graph $G$ on $n$ vertices (represented in, say, adjacency matrix form) and some parameter $C$, runs in time $T = O\bigl(n^2\cdot \sqrt{C}\bigr)$. Is the algorithm taking polynomial time or pseudo polynomial time?
Polynomial time for a graph algorithm
1
$\begingroup$
asymptotics
-
0How does $C$ depend on $n$? Do you know something about this? – 2012-11-09
-
0C depends on n but I dont know how. – 2012-11-09