نتایج جستجو برای: roman yakubson
تعداد نتایج: 13951 فیلتر نتایج به سال:
An Anglican theologian contends that the claim to absolute protection for the human embryo from the moment of conception is a recent one in the Roman Catholic moral tradition. Citing pre-classical, classical, biblical, and post-biblical Roman Catholic sources, Dunstan argues that these traditions attempted to grade the protection provided to the nascent human being according to the stages of i...
The region of Campania exerted a powerful influence over the Roman cultural imagination. the volcanic landscape around the Bay of naples was blessed with immense natural beauty and abundance but also harbored some of nature’s most violent forces. in this suitably monumental setting, mythological heroes such as Heracles and aeneas were said to have performed famous deeds. campania was, moreover,...
We analyze the graph-theoretic formalization of Roman domination, dating back to the military strategy of Emperor Constantine, from a parameterized perspective. More specifically, we prove that this problem is W[2]-complete for general graphs. However, parameterized algorithms are presented for graphs of bounded treewidth and for planar graphs. Moreover, it is shown that a parametric dual of Ro...
When, as teenagers, we visited the historic site of Vaison-la-Romaine in Southern France, the discovery of Roman capitals buried under the foundations of a mediaeval church was really astounding. How, besides reusing full blocks of the antique architecture, the builders dared reduce the most worked Roman stones to the humble function of backfill? Have new builders become totally disrespectful t...
A {em Roman dominating function} on a graph $G$ is a function$f:V(G)rightarrow {0,1,2}$ satisfying the condition that everyvertex $u$ for which $f(u) = 0$ is adjacent to at least one vertex$v$ for which $f(v) =2$. {color{blue}A {em restrained Roman dominating}function} $f$ is a {color{blue} Roman dominating function if the vertices with label 0 inducea subgraph with no isolated vertex.} The wei...
Abstract: Let G=(V,E) be a graph and let f:V(G)→{0,1,2} be a function. A vertex v is protected with respect to f, if f(v)>0 or f(v)=0 and v is adjacent to a vertex of positive weight. The function f is a co-Roman dominating function, abbreviated CRDF if: (i) every vertex in V is protected, and (ii) each u∈V with positive weight has a neighbor v∈V with f(v)=0 such that the func...
comment étudier les textes romanesques français si nombreux depuis la formation définitive de la langue française au xviie siècle? c'est la question à laquelle les critiques ont essayé de répondre. pourtant, de la critique traditionnelle à celle moderne, le chercheur est confronté à une diversité vertigineuse qui ne cesse de croître. suite à la nouvelle critique rassemblant les jeunes crit...
ce travail retrace lhistoire de michel cousin, un statisticien troublé, qui cherche désespérément à combler le vide de son existence auquel fait écho la vacuité des relations. a défaut de trouver l’amour chez ses contemporains, il séprend dun python adulte capable de l’enlacer dans une puissante étreinte. mais la vie parisienne avec gros-câlin, son python de deux mètres vingt, ne va pas sans tr...
We investigate a domination-like problem from the exact exponential algorithms viewpoint. The classical Dominating Set problem ranges among one of the most famous and studied NP -complete covering problems [6]. In particular, the trivial enumeration algorithm of runtime O∗(2n) 4 has been improved to O∗(1.4864n) in polynomial space, and O∗(1.4689n) with exponential space [9]. Many variants of th...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید