نتایج جستجو برای: intertextuality and intersection
تعداد نتایج: 16830309 فیلتر نتایج به سال:
Given a digraph D = (V,A) and a positive integer k, an arc set F ⊆ A is called a karborescence if it is the disjoint union of k spanning arborescences. The problem of finding a minimum cost k-arborescence is known to be polynomial-time solvable using matroid intersection. In this paper we study the following problem: find a minimum cardinality subset of arcs that contains at least one arc from ...
A proper non-empty subset C of the points of a linear space S = (P; L) is called line-closed if any two intersecting lines of S , each meeting C at least twice, have their intersection in C. We show that when every line has k points and every point lies on r lines the maximum size for such sets is r + k ? 2. In addition it is shown that this cannot happen for projective spaces PG(n; q) unless q...
Providing faultless proceeding of the engineer in order to protect the rivers, requires understanding the morphological behavior of the river and studying the hydrodynamic phenomena of the area. The intersection of the Karun rivers as the largest and longest river in Iran with the Arvand border river is of considerable importance due to its strategic location. In this paper, using field measure...
This study was carried out to analyze the variations of Benzene, Toluene, and para- Xylene (BTp-X) present in the urban air of Delhi. These pollutants can enter into the human body through various pathways like inhalation, oral and dermal exposure posing adverse effects on human health. Keeping in view of the above facts, six different locations of Delhi were selected for the study during summe...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید