نتایج جستجو برای: t path
تعداد نتایج: 834072 فیلتر نتایج به سال:
A tree is a structure T = (T,E), where T is a nonempty set whose elements are called nodes and E is a relation on T , E ⊆ T × T , called the immediate edge relation, satisfying the following conditions: for all nodes, n, n′,m ∈ T , • Every node has a unique predecessor: If nEm and n′Em, then n = n′, • There are no cycles: If (n1, . . . , nk) is a sequence of nodes where for each i = 1, . . . , ...
We show that, for a class of systems described by a Lagrangian L(x, ˙ x, t) = 1 2 ˙ x 2 − V (x, t) the propagator K x ′′ , t ′′ ; x ′ , t ′ = e i ¯ h t ′′ t ′ dtL(x, ˙ x,t) D [x(t)] can be reduced via Noether's Theorem to a standard path integral multiplied by a phase factor. Using Henstock's integration technique, this path integral is given a firm mathematical basis. Finally, we recast the pr...
The Rooted Distance-Constrained Minimum Spanning Tree Problem (RDMSTP) is defined as follows: given a graph G = (V,E) with node set V = {0,1,...,n} and edge set E, two integer weights, a cost ce and a delay we associated with each edge e of E, and a natural (time limit) number H, we wish to find a spanning tree T of the graph with minimum total cost and such that the unique path from a specifie...
We present eecient algorithms for nding rectilinear collision-free paths between two given points among a set of rectilinear obstacles. Our results improve the time complexity of previous results for nding the shortest rectilinear path, the minimum-bend shortest rectilinear path, the shortest minimum-bend rectilinear path and the minimum-cost rectilinear path. For nding the shortest rectilinear...
We present a technique to resolve the rare event problem for a Langevin equation describing a system with thermally activated transitions. A transition event within a given time interval (0,t(f)) can be described by a transition path that has an activation part during (0,t(M)) and a deactivation part during (t(M),t(f))(0<t(M)<t(f)). The activation path is governed by a Langevin equation with ne...
Let T be a node-weighted tree with n nodes, and let π(u, v) denote the path between two nodes u and v in T . We address two problems: (i) Path Maximum Query: Preprocess T so that, for a query pair of nodes u and v, the maximum weight on π(u, v) can be found quickly. (ii) Path Maximum Sum Query: Preprocess T so that, for a query pair of nodes u and v, the maximum weight sum subpath of π(u, v) ca...
Let T be a tree in Rd and let ∆ > 0 be a real number. The aim is to preprocess T into a data structure, such that for any polygonal query path Q, we can decide if T contains a path P whose Fréchet distance δF (Q,P ) to Q is at most ∆. For any real number ε > 0, we present an efficient data structure that solves an approximate version of this problem for the case when T is c-packed and each of t...
For a spanning tree T in a nontrivial connected graph G and for vertices u and v inG, there exists a unique u−v path u = u0, u1, u2, . . ., uk = v in T . A u− v T -path in G is a u− v path u = v0, v1, . . . , vl = v in G that is a subsequence of the sequence u = u0, u1, u2, . . . , uk = v. A u− v T -path of minimum length is a u− v T -geodesic in G. The T distance dG|T (u, v) from u to v in G i...
A path from s to t on a polyhedral terrain is descending if the height of a point p never increases while we move p along the path from s to t. No efficient algorithm is known to find a shortest descending path (SDP) from s to t in a polyhedral terrain. We give two approximation algorithms (more precisely, FPTASs) that solve the SDP problem on general terrains. Both algorithms are simple, robus...
a r t i c l e i n f o a b s t r a c t Keywords: Graph algorithms Simple-path convexity Simple-path convex hull Totally balanced hypergraphs In a connected hypergraph a vertex set X is simple-path convex (sp-convex, for short) if either |X| 1 or X contains every vertex on every simple path between two vertices in X (Faber and Jamison, 1986 [7]), and the sp-convex hull of a vertex set X is the mi...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید