74 search results - page 2 / 15 » On edge orienting methods for graph coloring |
AINA
2010
IEEE
13 years 9 months ago
2010
IEEE
—Symmetry breaking is a fundamental operation in distributed computing. It has applications to important problems such as graph vertex and edge coloring, maximal independent sets...
APPROX
2004
Springer
13 years 10 months ago
2004
Springer
Consider the following communication problem, that leads to a new notion of edge coloring. The communication network is represented by a bipartite multigraph, where the nodes on o...
AUSAI
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. The RGCP (Robust Graph Coloring problem) is a new variant of the traditional graph coloring problem. It has numerous practical applications in real world like timetabling...
DM
1999
13 years 4 months ago
1999
A module of an undirected graph is a set X of nodes such for each node x not in X , either every member of X is adjacent to x, or no member of X is adjacent to x. There is a canon...
MCPR2
2011
12 years 7 months ago
2011
We present a strategy that combines color and depth images to detect people in indoor environments. Similarity of image appearance and closeness in 3D position over time yield weig...