Before revision:  The first meeting time on a graph is defined by the time it takes for multiple random walkers to meet at the same node in graph. The first meeting time is closely related to the rendezvous problem, which is are a fundamental problem in the field of computer science.
After revision:  The first meeting time on a graph is defined by the time it takes for multiple random walkers to meet at the same node in a graph. This time is closely related to the rendezvous problem, which is are a fundamental problem in the field of computer science.