نتایج جستجو برای: respectively totally
تعداد نتایج: 711593 فیلتر نتایج به سال:
A subset X of vertices and edges of a graph G is totally matching if no two elements of X are adjacent or incident. In this paper we determine all graphs in which every maximal total matching is maximum.
In this paper we prove that one can find surgeries arbitrarily close to infinity in the Dehn surgery space of the figure eight knot complement for which some immersed totally geodesic surface compresses. MSC: 57M25, 57M50
BACKGROUND Remote-access perfusion and robotics have enabled totally endoscopic closure of atrial septal defect (ASD) and patent foramen ovale (PFO). We report on a stepwise approach to a totally endoscopic procedure. METHODS Seventeen patients (median age, 39 years; range, 21-55 years) underwent limited-access ASD or PFO closure. As a preparative step, the operation was carried out through m...
The theory of respectively interpretation proposed in Yatabe and Tam (2021) "In defense an HPSG-based non-constituent coordination" (Linguistics Philosophy 44, pp. 1-77) entails that Binding Conditions A B need to be formulated as constraints on the form semantic representations. It is possible formulate two binding conditions such if anaphoric relations are encoded representations a way analog...
We consider totally unimodular (TU) stochastic programs, that is, two-stage stochastic programs whose extensive-form constraint matrix is TU. We generalize the notion of total unimodularity to apply to sets of matrices and provide properties of such sets. We provide several sufficient conditions on stochastic programs to be TU. When solving TU stochastic problems using the L-shaped method, it i...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید