نتایج جستجو برای: roman libertin

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

Journal: :Acta Universitatis Lodziensis 2021

La question que nous poserons dans cet article sera de savoir comment parle l’amour physique un des plus grands chanteurs français tous les temps, poètes francophones du XXe siècle, Georges Brassens. Le choix ce thème s’explique d’une part par la réputation Brassens en tant chanteur libertin voire pornographe, auteur-interprète chansons à scandale telles gorille, mauvais sujet repenti ou P… toi...

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...

Journal: :recherches en langue et litterature françaises 0
mehregan nezamizadeh professeur- assistant, l'université allameh taba tabayi

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...

پایان نامه :دانشگاه آزاد اسلامی - دانشگاه آزاد اسلامی واحد تهران مرکزی - دانشکده زبانهای خارجی 1392

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...

2013
Mathieu Chapelle Manfred Cochefert Jean-François Couturier Dieter Kratsch Mathieu Liedloff Anthony Perez

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...

2013
Eric Adler

Contemporary scholars of Roman imperialism have discussed the ways in which ancient historians denigrate non-Romans and thereby present intellectual justifications for Roman conquest. This paper offers a case study that questions this position's validity: an examination of Sallust's Epistula Mithridatis (Hist. 4.69M) and Pompeius Trogus' speech of Mithridates (Justin 38.4-7). I argue that Sallu...

2012
Yunkyong Hyon Thomas R. Powers Roman Stocker Henry C. Fu

Yunkyong Hyon, null Marcos, Thomas R. Powers, Roman Stocker and Henry C. Fu Journal of Fluid Mechanics / Volume 705 / August 2012, pp 58 ­ 76 DOI: 10.1017/jfm.2012.217, Published online: 15 June 2012 Link to this article: http://journals.cambridge.org/abstract_S0022112012002170 How to cite this article: Yunkyong Hyon, null Marcos, Thomas R. Powers, Roman Stocker and Henry C. Fu (2012). The wigg...

Journal: :CoRR 2014
Zheng Shi Khee Meng Koh

We provide two algorithms counting the number of minimum Roman dominating functions of a graph on n vertices in (1.5673) n time and polynomial space. We also show that the time complexity can be reduced to (1.5014) n if exponential space is used. Our result is obtained by transforming the Roman domination problem into other combinatorial problems on graphs for which exact algorithms already exist.

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

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