نتایج جستجو برای: smallest path

تعداد نتایج: 165308  

Journal: :Zootaxa 2014
Thomas van de Kamp Frank H Hennemann

The female and egg of the new Papuan leaf insect Phyllium (Phyllium) riedeli n. sp. are described and illustrated. The species belongs in the siccifolium species-group of the subgenus Phyllium and, with a body length of 56.3 mm, represents the smallest leaf insect so far described for the genus. The type-specimens are stored in the State Museum of Natural History Karlsruhe, Germany (SMNK). A ch...

2004
MICHAEL A. JACKSON

The strong symmetric genus of a finite group G is the smallest genus of a closed orientable topological surface on which G acts faithfully as a group of orientation preserving automorphisms. In this paper we complete the calculation of the strong symmetric genus for each finite Coxeter group excluding the group E8.

2011
Emilio Seijo

This paper introduces a version of the argmax continuous mapping theorem that applies to M-estimation problems in which the objective functions converge to a limiting process with multiple maximizers. The concept of the smallest maximizer of a function in the d-dimensional Skorohod space is introduced and its main properties are studied. The resulting continuous mapping theorem is applied to th...

Journal: :European Journal of Pure and Applied Mathematics 2023

A vertex w in a connected graph G strongly resolves two distinct vertices u and v V (G) if is any shortest u-w path or v-w path. set W of strong resolving every are resolved by some W. S subset hop dominating for ∈ \ there exists such that dG(u, v) = 2. The smallest cardinality called the domination number G. This paper presents characterization sets join, corona lexicographic product graphs. F...

2007
Hee-Kap Ahn Mohammad Farshi Christian Knauer Michiel H. M. Smid Yajun Wang

Let C be a polygonal cycle on n vertices in the plane. A randomized algorithm is presented which computes in O(n log n) expected time, the edge of C whose removal results in a polygonal path of smallest possible dilation. It is also shown that the edge whose removal gives a polygonal path of largest possible dilation can be computed in O(n log n) time. If C is a convex polygon, the running time...

Journal: :The Journal of Logic Programming 1996

Journal: :An Homage to Ezra Pound 1985

Journal: :Journal of Algebra 2001

Journal: :The Annals of Statistics 2001

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید