• No results found

[PDF] Top 20 An algorithmic approach for multi-color Ramsey graphs

Has 10000 "An algorithmic approach for multi-color Ramsey graphs" found on our website. Below are the top 20 most common "An algorithmic approach for multi-color Ramsey graphs".

An algorithmic approach for multi-color Ramsey graphs

An algorithmic approach for multi-color Ramsey graphs

... Classical The is not specifically assigned, the such be a classical that there multi-color numbers exist The usually Ramsey A is number difficult to prove; author assumes complexity, ord[r] ... See full document

42

AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS

AN ALGORITHMIC APPROACH TO EQUITABLE EDGE CHROMATIC NUMBER OF GRAPHS

... Veninstine Vivik J. is working as an Assistant Professor in the Department of Mathematics, Karunya University, India. He has 10 years of teaching experience. He obtained his masters degree in 2004 and M. Phil in ... See full document

10

Multi algorithmic IRIS Recognition

Multi algorithmic IRIS Recognition

... iris recognition system with very low error probability. The threshold value of 0.15 has been chosen for matching iris patterns in this work and if the HD is below 0.15, the two iris pattern are given a match and is a ... See full document

9

Calculating Ramsey numbers by partitioning colored graphs

Calculating Ramsey numbers by partitioning colored graphs

... It is easy to see that in order to prove Conjecture 5.1, it is sufficient to prove it only in the case when H is a (not necessarily balanced) complete multipartite graph. The techniques used in this paper look like they ... See full document

25

A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs

A General Lower Bound on Gallai-Ramsey Numbers for Non-Bipartite Graphs

... Since, by Theorem 1, every G-coloring of a complete graph has a partition of the vertices that forms a blow-up of a 2-coloring, it is important to consider colorings that avoid a monochromatic copy of H while still ... See full document

7

NEW APPROACH IN COLOR DISTORTION REDUCTION IN UNDERWATER CORAL REEF COLOR IMAGE 
ENHANCEMENT BASED ON ESTIMATION ABSORPTION USING EXPONENTIAL EQUATION

NEW APPROACH IN COLOR DISTORTION REDUCTION IN UNDERWATER CORAL REEF COLOR IMAGE ENHANCEMENT BASED ON ESTIMATION ABSORPTION USING EXPONENTIAL EQUATION

... underwater color image. This method operates on RGB and HSV color models, and the results of both models are combined using the Euclidean ...proposed approach can enhance the quality and image ... See full document

8

Heterotic compactification, an algorithmic approach

Heterotic compactification, an algorithmic approach

... Starting with the pioneering work in [10, 11], there has been continuing activity on Calabi-Yau based non-standard embedding models over the years. Recently, there has been significant progress both from the mathematical ... See full document

37

Multi-Algorithmic Face Authentication System

Multi-Algorithmic Face Authentication System

... The multi-algorithmic authentication methods for face recognition proposed in [7], [8] have not handled on the challenges of occlusion, pose and illumination ... See full document

6

Quasi randomness and algorithmic regularity for graphs with general degree distributions

Quasi randomness and algorithmic regularity for graphs with general degree distributions

... In the present work we consider a concept of quasi-randomness that takes into account vertex degrees. Other concepts that do not refer to the degree sequence (and are therefore restricted to approximately regular ... See full document

28

Pseudo Complete Color Critical Graphs

Pseudo Complete Color Critical Graphs

... 2 edges. Now H can be obtained from G by recursively performing 2-splitting operations and each of these operations can be reversed by an identification of a pair of vertices of same color. Hence (1) implies (3). ... See full document

8

An algorithmic approach to string phenomenology

An algorithmic approach to string phenomenology

... of approach to the special corner is not obvious, instead, a synthetic rather than analytic perspective may prove to be ...of algorithmic scan is indeed facilitated by the rapid advances in computational ... See full document

13

BRAIN TUMOR SEGMENTATION USING ALGORITHMIC AND NON ALGORITHMIC APPROACH

BRAIN TUMOR SEGMENTATION USING ALGORITHMIC AND NON ALGORITHMIC APPROACH

... of algorithmic concepts that can be used to define heuristic methods applicable to a wide set of different ...general algorithmic framework, which can be applied to different optimization problems with ... See full document

14

EVOLUTIONARY ALGORITHMIC APPROACH FOR DATA MINING

EVOLUTIONARY ALGORITHMIC APPROACH FOR DATA MINING

... Example: As discussed earlier, let a chromosome be 3|1|6|1|4|1|, for mutation a random number is chosen using the random() function. For example, let the first gene is selected for mutation, then after mutation ... See full document

6

Incremental View Maintenance: An Algorithmic Approach

Incremental View Maintenance: An Algorithmic Approach

... novel approach that correctly maintains the materialized view in a ware housing ...maintenance approach to overcome the anomalies in the previous standard approaches and would greatly help in warehousing ... See full document

6

Cluster Energy Optimization: An Algorithmic Approach

Cluster Energy Optimization: An Algorithmic Approach

... In this paper we have emphasized on developing an eco-friendly cloud computing by turning the switches of idle CPUs of IaaS off, simultaneously we have focused on avoiding SLA violation for minimized energy consumption ... See full document

6

Supersaturation problem for color critical graphs

Supersaturation problem for color critical graphs

... and appropriate q = q(n). Therefore, we need only to compare graphs obtained from a complete 2-partite graph by adding extra edges. As observed earlier, F = K s,2 + is not pair-free. However, any copy of F which ... See full document

39

On the outer-connected reinforcement and bondage problems in bipartite graphs: the algorithmic complexity

On the outer-connected reinforcement and bondage problems in bipartite graphs: the algorithmic complexity

... The rest of the paper is organized as follows: In Section 2, we remind the 3− Sat problem. The proofs for the hardness of the Outer-Connected Bondage and the Outer- Connected Reinforcement problems in bipartite ... See full document

12

The effect of solid ink density on shifts in hue in gray component replacement

The effect of solid ink density on shifts in hue in gray component replacement

... 60% ink chromatic, Figure depicting ink for Graphs cyan variations of yellow, magenta, for color patch #6 for the normal 60% GCR, and the 100% GCR color process.. Graphs cyan chromatic, [r] ... See full document

103

Rule Based Action Plans Generation in A Multi Agent System- An Algorithmic Approach

Rule Based Action Plans Generation in A Multi Agent System- An Algorithmic Approach

... and algorithmic way, multi agent communication can takes place without any ...other multi agent properties, as cooperation, coordination and ...through multi agent system involving all their ... See full document

7

All Ramsey (2K2,C4)−Minimal Graphs

All Ramsey (2K2,C4)−Minimal Graphs

... all graphs in R (2K 2 , 2P 3 ...of graphs belonging to the class R (3K 2 , P 3 ) and obtained all graphs in this set, which can be also found in [9] without proof, except one ...of graphs in R ... See full document

17

Show all 10000 documents...