نتایج جستجو برای: path
تعداد نتایج: 139494 فیلتر نتایج به سال:
Here we prove a stability version of a Ramsey-type Theorem for paths. Thus in any 2-coloring of the edges of the complete graph Kn we can either find a monochromatic path substantially longer than 2n/3, or the coloring is close to the extremal coloring.
Let G = (V,E) be an n-nodes non-negatively real-weighted undirected graph. In this paper we show how to enrich a single-source shortest-path tree (SPT) of G with a sparse set of auxiliary edges selected from E, in order to create a structure which tolerates effectively a path failure in the SPT. This consists of a simultaneous fault of a set F of at most f adjacent edges along a shortest path e...
The concept of generalized path algebras was introduced in Coelho and Liu (2000). It shown Ibáñez Cobos et al. (2008) how to obtain the Gabriel quiver a given algebra. In this article, we generalize algebra allow them have relations, extend result new setting. Moreover, use extended mentioned above address inverse problem: that is, problem determining when is isomorphic non-trivial way.
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید