Polynomial-time algorithm for Graph Isomorphism in case of Maximum Constrained Maximum Degree
Algorithms used in practice differ a lot from theoretical algorithms. One popular software package is nauty. The link should also explain the algorithms used, which probably rely on combinatorial methods.

As for the running times for specific algorithms, they are likely stated in the papers. I suggest checking the references.