214 search results - page 42 / 43 » A linear time algorithm for L(2,1)-labeling of trees |
171
click to vote
WG
1993
Springer
15 years 10 months ago
1993
Springer
Recently in several papers, graphs with maximum neighborhood orderings were characterized and turned out to be algorithmically useful. This paper gives a unified framework for cha...
185
click to vote
CP
2006
Springer
15 years 9 months ago
2006
Springer
Dynamic detection and elimination of symmetry in constraints, is in general a hard task, but in Not-Equals binary constraint networks, the symmetry conditions can be simplified. I...
158
click to vote
MOBIHOC
2003
ACM
16 years 5 months ago
2003
ACM
In this paper, we address the problem of energy-conscious cache placement in wireless ad hoc networks. We consider a network comprising a server with an interface to the wired net...
186
click to vote
KDD
2006
ACM
16 years 6 months ago
2006
ACM
In many text classification applications, it is appealing to take every document as a string of characters rather than a bag of words. Previous research studies in this area mostl...
170
click to vote
COCOA
2009
Springer
15 years 10 months ago
2009
Springer
: Under water sensor network is an important research direction in computer science. There are many interesting optimization problems regarding its design, routing and applications...