Path differentiation: further unification

Udayan Darji; Michael Evans

Displaying similar documents to “Path differentiation: further unification”

From $(2, 3)$ -Motzkin paths to Schröder paths.

Yan, Sherry H.F. (2007)

Journal of Integer Sequences [electronic only]

Similarity:

Dyck paths with no peaks at height $k$ .

Peart, Paul, Woan, Wen-Jin (2001)

Journal of Integer Sequences [electronic only]

Similarity:

On extreme first return path derivatives

Aliasghar Alikhani-Koopaei (2002)

Mathematica Slovaca

Similarity:

The Maximum Capacity Shortest Path Problem: Generation of Efficient Solution Sets

T. Brian Boffey, R. C. Williams, B. Pelegrín, P. Fernandez (2010)

RAIRO - Operations Research

Similarity:

Individual items of flow in a telecommunications or a transportation network may need to be separated by a minimum distance or time, called a “headway”. If link dependent, such restrictions in general have the effect that the minimum time path for a “convoy” of items to travel from a given origin to a given destination will depend on the size of the convoy. The Quickest Path problem seeks a path to minimise this convoy travel time. A closely related bicriterion problem is the Maximum...