نتایج جستجو برای: italian domatic number
تعداد نتایج: 1199845 فیلتر نتایج به سال:
Inclusion/exclusion and measure and conquer are two of the most important recent new developments in the field of exact exponential time algorithms. Algorithms that combine both techniques have been found very recently, but thus far always use exponential space. In this paper, we try to obtain fast exponential time algorithms for graph domination problems using only polynomial space. Using a no...
The aim of this study was to test whether both phonetic and phonological representations of intonation can be rapidly modified when imitating utterances belonging to a different regional variety of the same language. Our main hypothesis was that tonal alignment, just as other phonetic features of speech, would be rapidly modified by Italian speakers when imitating pitch accents of a different (...
NP-complete problems cannot have efficient algorithms unless P = NP. Due to their importance in practice, however, it is useful to improve the known exponential-time algorithms for NP-complete problems. We survey some of the recent results on such improved exponential-time algorithms for the NP-complete problems satisfiability, graph colorability, and the domatic number problem. The determinist...
A restrained Italian dominating function (RID-function) on a graph G=(V,E) is f:V→{0,1,2} satisfying: (i) f(N(u))≥2 for every vertex u∈V(G) with f(u)=0, where N(u) the set of vertices adjacent to u; (ii) subgraph induced by assigned 0 under f has no isolated vertices. The weight an RID-function sum its value over whole vertices, and domination number minimum G. In this paper, we initiate study ...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید