نتایج جستجو برای: cograph
تعداد نتایج: 221 فیلتر نتایج به سال:
A permutation graph is an intersection graph of segments lying between two parallel lines. A Seidel complementation of a finite graph at a vertex v consists in complementing the edges between the neighborhood and the non-neighborhood of v. Two graphs are Seidel complement equivalent if one can be obtained from the other by a sequence of Seidel complementations. In this paper we introduce the ne...
The notion of mirror nodes, first introduced by Fomin, Grandoni and Kratsch in 2006, turned out to be a useful item for their design of an algorithm for the maximum independent set problem (MIS). Given two nodes u, v of a graph G = (V, E) with distG(u, v) = 2, u is called a mirror of v if N(v) \N(u) induces a (possibly empty) clique. In order to have a well defined term, we add that every compl...
The focus of this paper is two fold. Firstly, we present a logical approach to graph modification problems such as minimum node deletion, edge deletion, edge augmentation problems by expressing them as an expression in first order (FO) logic. As a consequence, it follows that these problems have constant factor polynomial-time approximation algorithms. In particular, node deletion/edge deletion...
The ecologist H. T. Odum introduced a principle of physics, called Maximum Empower, in order to explain self-organization in a system (e.g. physical, biological, social, economical, mathematical, ...). The concept of empower relies on emergy, which is a second notion introduced by Odum for comparing energy systems on the same basis. The roots of these notions trace back to the 50’s (with the wo...
A fullerene graph is a cubic 3-connected plane graph with (exactly 12) pentagonal faces and hexagonal faces. Let Fn be a fullerene graph with n vertices. By the Euler formula one can see that Fn has 12 pentagonal and n/2 – 10 hexagonal faces. Let G = (V, E) be a connected graph with the vertices set V = V(G) and the edges set E = E(G), without loops and multiple edges. The distance d(x,y) betwe...
H. Nishino, K. Abe, Y. Hayato, T. Iida, M. Ikeda, J. Kameda, Y. Koshio, M. Miura, S. Moriyama, M. Nakahata, S. Nakayama, Y. Obayashi, H. Sekiya, M. Shiozawa, Y. Suzuki, A. Takeda, Y. Takenaga, Y. Takeuchi, K. Ueno, K. Ueshima, H. Watanabe, S. Yamada, S. Hazama, I. Higuchi, C. Ishihara, H. Kaji, T. Kajita, K. Kaneyuki,* G. Mitsuka, K. Okumura, N. Tanimoto, F. Dufour, E. Kearns, M. Litos, J. L. R...
The MaxSTC problem is an assignment of the edges with strong or weak labels having the maximum number of strong edges such that any two vertices that have a common neighbor with a strong edge are adjacent. The Cluster Deletion problem seeks for the minimum number of edge removals of a given graph such that the remaining graph is a disjoint union of cliques. Both problems are known to be NP-hard...
Given an undirected graph G = (V, E) and a weight function w : V → R, a vertex coloring of G is a partition of V into independent sets, or color classes. The weight of a vertex coloring of G is defined as the sum of the weights of its color classes, where the weight of a color class is the weight of a heaviest vertex belonging to it. In the W C problem, we want to determine the mi...
banned psychoanalysis as a Jewish science and there was no organized psychotherapy in a situation dominated by racial biology. In Psychotherapy in the Third Reich, Cocks recovered the history of the German institute for psychological research and psychotherapy, generally known as the Goering Institute after its chief, the psychotherapist Mathias Goering, a cousin of the infamous Hermann Goering...
The number of homomorphisms hom(G,Kk) from a graph G to the complete graph Kk is the value of the chromatic polynomial of G at a positive integer k. This motivates the following (cf. [3]): Definition 1 A sequence of graphs (Hk), k = (k1, . . . , kh) ∈ N , is strongly polynomial if for every graph G there is a polynomial p(G; x1, . . . , xh) such that hom(G,Hk) = p(G; k1, . . . , kh) for every k...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید