197 search results - page 13 / 40 » Some Topological Methods in Graph Coloring Theory |
132
Voted
APPROX
2004
Springer
15 years 9 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...
154
Voted
DC
2002
15 years 3 months ago
2002
A new general theory about restoration of network paths is first introduced. The theory pertains to restoration of shortest paths in a network following failure, e.g., we prove th...
121
click to vote
ICIP
2009
IEEE
16 years 4 months ago
2009
IEEE
In this paper, we present a local graph matching based method for tracking cells and cell divisions in noisy images. We work with plant cells, where the cells are tightly clustere...
122
Voted
FOIS
2001
15 years 5 months ago
2001
-- Representation theorems for systems of regions have been of interest for some time, and various contexts have been used for this purpose: Mormann [17] has demonstrated the fruit...
122
Voted
RANDOM
1999
Springer
15 years 8 months ago
1999
Springer
Abstract. In this article we introduce (combinatorial) multi{color discrepancy and generalize some classical results from 2{color discrepancy theory to ccolors. We give a recursive...