The authors propose an efficient algorithm for handling distinct shortest walks in graph databases with multiple labels, achieving satisfactory complexity bounds.
