This thesis presents novel techniques for designing efficient algorithms to solve various graph problems, with a focus on both sequential and parallel computation models. The key contributions include: An O(dm)O(dm)O(dm) ...