نتایج جستجو برای: 2 independence number
تعداد نتایج: 3428748 فیلتر نتایج به سال:
The local independence number i (G) of a graph G at a distance i is the maximum number of independent vertices at distance i from any vertex. We study the impact of restricting i (G) on the (global) independence number (G). Among others, we show that in graphs with bounded diameter, (G) is bounded if and only if i (G) is bounded for at least one i, 2 i diam(G).
Social Rehabilitation and Independence of Individuals Following Trauma, Disease or Chronic Pathology
In recent years there has been an increase in the number of people requiring rehabilitation services. The genesis of rehabilitation services has been, in part, a response to the recognition that increasing the quality of life and independence of individuals following trauma, disease or enduring chronic pathology benefits society as a whole, as well as the individual. Human beings also have psyc...
We consider the problem of approximating the independence number and the chromatic number of k-uniform hypergraphs on n vertices. For xed integers k 2, we obtain for both problems that one can achieve in polynomial time approximation ratios of at most O(n=(log 1) n)2). This extends results of Boppana and Halld orsson [5] who showed for the graph case that an approximation ratio of O(n=(logn)) c...
Background: Centers of excellence are organizations with prominent activities in a specific field and are capable of delivering quality services using specialized equipment, innovative techniques, and modern technologies. They can also bring financial benefits and cost recovery to their organizations. So, promoting the independence of these organizations plays a critical role in maintaining sus...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید