Search results for "Clique"

A comparison of compatible, finite, and inductive graph properties

1993

Abstract In the theory of hyperedge-replacement grammars and languages, one encounters three types of graph properties that play an important role in proving decidability and structural results. The three types are called compatible, finite, and inductive graph properties. All three of them cover graph properties that are well-behaved with respect to certain operations on hypergraphs. In this paper, we show that the three notions are essentially equivalent. Consequently, three lines of investigation in the theory of hyperedge replacement - so far separated - merge into one.

Iron oxides nanoparticles and titanate nanotubes dedicated to multimodal imaging and anticancer therapy

2013

The new implementations of nanoparticles in the medical field are one of the essential factors of the medical progress expected at the beginning of this XXIst century. Thus, the domain of the medical imaging is also affected by this technological evolution. This work consisted in developing theranostic probes with iron oxides nanoparticles (SPIO) and titanate nanotubes (TiONts) for multimodal imaging (magnetic/nuclear or magnetic/optical) and also possessing a therapeutic effect (hyperthermia/PDT or radiosensitization/PDT).The titanate nanotubes of this study have an average length of about 150 nm and were obtained by Kasuga's hydrothermal synthesis. These nanotubes present an outside diame…

On the chromatic number of disk graphs

1998

Colorings of disk graphs arise in the study of the frequency-assignment problem in broadcast networks. Motivated by the observations that the chromatic number of graphs modeling real networks hardly exceeds their clique number, we examine the related properties of the unit disk (UD) graphs and their different generalizations. For all these graphs including the most general class of the double disk (DD) graphs, it is shown that X(G) ≤ c.ω(G) for a constant c. Several coloring algorithms are analyzed for disk graphs, aiming to improve the bounds on X(G). We find that their worst-case performance expressed in the number of used colors is indeed reached in some instances.

How Do Efforts to Enhance Career Preparation Affect Peer Groups?

2010

The present study investigated how efforts to enhance career preparation affect peer groups. The participants were 710 9th graders who were randomized into control and intervention groups and assessed 3 times during 1 academic year: at baseline (T1, Fall), immediately after the career preparation intervention (T2, 3 months after baseline), and 5 months after the intervention (T3, Spring). The results showed, first, that maintenance of a stable clique was more likely when most clique members participated in the intervention. Second, it was found that the members of adolescents' cliques resembled each other in respect of the strength of the intervention effect. Finally, the results showed tha…

Algorithms on Graphs

1988

In this chapter we shall develop some basic algorithms for directed graphs and relations which will be of use in later chapters, where the efficient construction of parsers is considered. The constructions needed can be expressed as the computing of certain “relational expressions”. These are expressions whose operands are relations and whose operators are chosen from among multiplication, closure, union and inverse. For this purpose we need to develop an algorithm for computing the closure of a relation. In view of the nature of our applications, the most appropriate way to do this is by a depth-first traversal of the graph that corresponds to the given relation. Other ways of computing th…

Maximum weight relaxed cliques and Russian Doll Search revisited

2015

Trukhanov et al. [Trukhanov S, Balasubramaniam C, Balasundaram B, Butenko S (2013) Algorithms for detecting optimal hereditary structures in graphs, with application to clique relaxations. Comp. Opt. and Appl., 56(1), 113–130] used the Russian Doll Search (RDS) principle to effectively find maximum hereditary structures in graphs. Prominent examples of such hereditary structures are cliques and some clique relaxations intensely discussed and studied in network analysis. The effectiveness of the tailored RDS by Trukhanov et al. for s-plex and s-defective clique can be attributed to their cleverly designed incremental verification procedures used to distinguish feasible from infeasible struct…

Application of graph grammars in music composing systems

1987

Potential approach in marginalizing Gibbs models

1999

Abstract Given an undirected graph G or hypergraph potential H model for a given set of variables V , we introduce two marginalization operators for obtaining the undirected graph G A or hypergraph H A associated with a given subset A ⊂ V such that the marginal distribution of A factorizes according to G A or H A , respectively. Finally, we illustrate the method by its application to some practical examples. With them we show that potential approach allow defining a finer factorization or performing a more precise conditional independence analysis than undirected graph models. Finally, we explain connections with related works.

Logical definability of NP-optimisation problems with monadic auxiliary predicates

1993

Given a first-order formula ϕ with predicate symbols e1...el, so,...,sr, an NP-optimisation problem on -structures can be defined as follows: for every -structure G, a sequence of relations on G is a feasible solution iff satisfies ϕ, and the value of such a solution is defined to be ¦S0¦. In a strong sense, every polynomially bounded NP-optimisation problem has such a representation, however, it is shown here that this is no longer true if the predicates s1, ...,sr are restricted to be monadic. The result is proved by an Ehrenfeucht-Fraisse game and remains true in several more general situations.

Complexes de métaux de transition avec des ligands carbènes N-hétérocycliques : synthèses et réactivité

2015

The purpose of this work is the synthesis of complexes containing imine-functionalized protic NHC ligands in order to further develop synthetic methodologies giving access to pNHC, C-bound ‘anionic’ imidazolide, and homo- and heterodinuclear complexes. In the case of imidazoles without functional group, deprotonation with n-butyl lithium afforded (1-aryl-1H-imidazol-2-yl)lithium in good yield. Reaction of (1-aryl-1H-imidazol-2-yl)lithium with [Ir(cod)(μ-Cl)]2 or [Rh(cod)(μ-Cl)]2 yielded a doubly C2,N3-bridged dinuclear complex. In the case of imine-functionalized imidazole, the Ir(I) N-bound imidazole complex can tautomerize to Ir(I) imine-functionalized pNHC complex chloride abstraction at…