# What is the name of this type of directed graph problem?

Take a directed graph $G$ where the edges are decorated with a a natural number. We want the set of all paths $P$ between two vertices $v_1$ and $v_2$ such that each successive edge in the path is decorated with a natural number that is greater than the natural number decorating the previous edge.

An application for this would be bus or train schedules. If you're trying to determine the different routes between two cities based on transfers between stations. (You can't take a second train scheduled to leave for before the first one arrives.)

I've informally been calling this a "scheduled graph". But I don't know what the name for this in the literature is.

Any references to algorithms related to this are of interest as well.

• mildly related: cstheory.stackexchange.com/questions/5849/… Apr 10, 2011 at 15:59
• If you consider the line graph of $G$ and oriented the edges from a lower-numbered node to a higher-numbered node, you obtain a DAG $G'$. Conversely, any acyclic orientation of any line graph can be obtained this way. Hence your problem seems to be essentially equal to the following problem: given an acyclic orientation of a line graph, find all directed paths that join a given pair of nodes. But I am not sure if the property of being a line graph really helps here...? Apr 10, 2011 at 16:54

The version of the problem which asks for the nondecreasing path from $s$ to $t$ with minimum last edge weight is typically referred to as "earliest arrivals" (since the last edge weight is the arrival time in the itinerary application). There's a lot of work in the literature focusing on this version.