570 search results - page 55 / 114 » Edge Coloring with Delays |
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— In the absence of a cost-effective technology for storing optical signals, emerging optical packet switched (OPS) networks are expected to have severely limited buffering capab...
138
click to vote
RSP
1998
IEEE
15 years 4 months ago
1998
IEEE
One of the major differences in partitioning for codesign is in the way the communication cost is evaluated. Generally the size of the edge cut-set is used. When communication bet...
ICIAP
2005
ACM
15 years 12 months ago
2005
ACM
In this paper we propose an automatic updating system for urban vector maps that is able to detect changes between the old dataset (consisting of both vector and raster maps) and t...
AINA
2010
IEEE
15 years 4 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...
EJC
2007
14 years 11 months ago
2007
We introduce and study online balanced coloring games on the random graph process. The game is played by a player we call Painter. Edges of the complete graph with n vertices are ...