نتایج جستجو برای: colorful directed paths
تعداد نتایج: 208849 فیلتر نتایج به سال:
We consider a variant of monotone simultaneous embeddings (MSEs) of directed graphs where all graphs are directed paths and have distinct directions of monotonicity. In contrast to the known result that any two directed paths admit an MSE, there exist examples of three paths that do not admit such an embedding for any possible choice of directions of monotonicity. We prove that if an MSE of thr...
This article analyzes directed lattice paths, when a boundary reflecting or absorbing condition is added to the classical models. The lattice paths are characterized by two time-independent sets of rules (also called steps) which have a privileged direction of increase and are therefore essentially one-dimensional objects. Depending on the spatial coordinate, one of the two sets of rules applie...
We show that the optimum shortcut, with respect to routing cost, in a directed path with weighted vertices can be found in linear time. To this end, we construct in linear time the lower envelope of an arrangement of pseudo-lines whose order at infinity is given. The algorithm can also be applied to star-shaped directed networks.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید