In this work we apply a procedure based on the quantum imaginary time evolution method to solve the unit-disk maximum independent set problem. Numerical simulations were performed for instances of 6, 8 and 10-qubits graphs. We have found that the failure probability of the procedure is relatively small and rapidly decreases with the number of shots. In addition, a theoretical upper bound for the failure probability of the procedure was obtained.