A set of pairwise edge-disjoint triangles of an edge-colored Kn is r-color avoiding if it does not contain r monochromatic triangles, each having a different color. Let fr(n) be the maximum integer so that in every edge coloring of Kn with r colors, there is a set of fr(n) pairwise edge-disjoint triangles that is r-color avoiding. We prove that 0.1177n2(1 − o(1)) < f2(n) < 0.1424n2(1 + o(1)). T...

The problem of edge-coloring a bipartite graph is to color the edges so that adjacent edges receive di erent colors. An optimal algorithm uses the minimum number of colors to color the edges. We consider several approximation algorithms for edge-coloring bipartite graphs and show tight bounds on the number of colors they use in the worst case. We also brie y consider the constrained edge-colori...

The problem of edge coloring a bipartite graph is to color the edges so that adjacent edges receive di erent colors An optimal algorithm uses the minimum number of colors to color the edges We consider several approximation algorithms for edge coloring bipartite graphs and show tight bounds on the number of colors they use in the worst case We also brie y consider the constrained edge coloring ...

An edge coloring of a plane graph G is facially proper if no two faceadjacent edges of G receive the same color. A facial (facially proper) parity edge coloring of a plane graph G is an (facially proper) edge coloring with the property that, for each color c and each face f of G, either an odd number of edges incident with f is colored with c, or color c does not occur on the edges of f . In th...

In this paper, we propose a demosaicing algorithm which interpolates the missing pixels on the estimated edge direction with modified edge indicator. We use gradients to estimate the edge direction which considers cross-channel correlation in addition to the within-channel correlation. After the edge direction is estimated, we interpolate the missing color values more precisely in aid of weight...

The goal of color constancy is to measure image colors despite differences in the color of the light source. Traditionally, the computational method of obtaining this ability is by using pixel values only. Recently, methods using edges instead of pixel values have been proposed. However, different edge types exist, such as material, shadow and specular edges. Therefore, in this paper, the main ...

This paper proposes a method, combining color and layout features, for identifying documents captured from lowresolution handheld devices. On one hand, the document image color density surface is estimated and represented with an equivalent ellipse and on the other hand, the document shallow layout structure is computed and hierarchically represented. The combined color and layout features are ...

We consider the problem of list edge coloring for planar graphs. Edge coloring is the problem of coloring the edges while ensuring that two edges that are incident receive different colors. A graph is k-edge-choosable if for any assignment of k colors to every edge, there is an edge coloring such that the color of every edge belongs to its color assignment. Vizing conjectured in 1965 that every...

Edge detection process has a widespread usage in computer vision applications. But it has a different output when its input image changes from color to grayscale. This changeability of results make us add modification on edge detection process procedures to correctly detect all those edges in color images that can’t be detected in gray ones. This research reviews the proposed solution of Dutta ...