570 search results - page 24 / 114 » Edge Coloring with Delays |
SIAMDM
2008
14 years 11 months ago
2008
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 th...
DM
2008
14 years 12 months ago
2008
The chromatic capacity cap(G) of a graph G is the largest k for which there exists a k-coloring of the edges of G such that, for every coloring of the vertices of G with the same ...
107
click to vote
ICIP
2005
IEEE
16 years 1 months ago
2005
IEEE
Abstract-- This paper presents a novel approach using combined features to retrieve images containing specific objects, scenes or buildings. The content of an image is characterize...
124
click to vote
ICCS
2004
Springer
15 years 5 months ago
2004
Springer
In the present paper routing and wavelength assignment (RWA) in optical WDM networks is discussed. Previous techniques on based on the integer linear programming and graph coloring...
102
click to vote
WEA
2007
Springer
15 years 6 months ago
2007
Springer
The Balanced Subgraph problem (edge deletion variant) asks for a 2-coloring of a graph that minimizes the inconsistencies with given edge labels. It has applications in social netw...