Given a dynamic graph where edge weights change every 5 minutes, analyze the efficiency of Dijkstra's algorithm versus A* search for real-time routing. Propose a modified heuristic or a bidirectional search approach that minimizes recomputation. Discuss the time and space complexity implications of your proposed solution.