Finding paths through narrow and wide trees
نویسندگان
چکیده
منابع مشابه
Finding paths through narrow and wide trees
We consider two axioms of second-order arithmetic. These axioms assert, in two different ways, that infinite but narrow binary trees always have infinite paths. We show that both axioms are strictly weaker than Weak König’s Lemma, and incomparable in strength to the dual statement (WWKL) that wide binary trees have paths.
متن کاملOn Finding and Updating Spanning Trees and Shortest Paths
We consider one origin shortest path and minimum spanning tree computations in weighted graphs. We give a lower bound on the number of analytic functions of the input computed by a tree program which solves either of these problems equal to half the number of worst-case comparisons which well-known algorithms attain. We consider the work necessary to update spanning tree and shortest path solut...
متن کاملFinding Multiple Routing Paths in Wide-Area WDM Networks
In this paper a multiple routing path problem in wide area Wavelength Division Multiplexing (WDM) networks is considered, which is to find K edge-disjoint lightpaths/semilightpaths from a source to a destination, if they exist, such that they meet some specified optimization objective. Two versions of the problem are studied. One is to minimize the total cost of the K paths, and the other is to...
متن کاملFinding transition paths and rate coefficients through accelerated Langevin dynamics.
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...
متن کاملPaths, Trees, and Flowers
“Jack Edmonds has been one of the creators of the field of combinatorial optimization and polyhedral combinatorics. His 1965 paper ‘Paths, Trees, and Flowers’ [1] was one of the first papers to suggest the possibility of establishing a mathematical theory of efficient combinatorial algorithms . . . ” [from the award citation of the 1985 John von Neumann Theory Prize, awarded annually since 1975...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Symbolic Logic
سال: 2009
ISSN: 0022-4812,1943-5886
DOI: 10.2178/jsl/1231082316