74 search results - page 5 / 15 » On edge orienting methods for graph coloring |
DAM
2008
13 years 7 months ago
2008
Let G = (V, E) be a graph with vertex set V and edge set E. The k-coloring problem is to assign a color (a number chosen in {1, . . . , k}) to each vertex of G so that no edge has...
ICMCS
2008
IEEE
14 years 1 months ago
2008
IEEE
This paper proposes an approach to image segmentation using Iterated Graph Cuts based on local texture features of wavelet coefficient. Using Multiresolution Analysis based on Ha...
ICCS
2004
Springer
14 years 22 days 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...
ASUNAM
2010
IEEE
13 years 9 months ago
2010
IEEE
Subgraph matching is a key operation on graph data. Social network (SN) providers may want to find all subgraphs within their social network that "match" certain query gr...
ICCI
1991
13 years 11 months ago
1991
The problem of coloring a set of n intervals (from the real line) with a set of k colors is studied. In such a coloring, two intersecting intervals must receive distinct colors. O...