395 search results - page 57 / 79 » Positive Versions of Polynomial Time |
160
click to vote
STACS
2009
Springer
16 years 13 days ago
2009
Springer
An edge-colored graph G is rainbow connected if any two vertices are connected by a path whose edges have distinct colors. The rainbow connectivity of a connected graph G, denoted ...
148
click to vote
ADHOCNOW
2008
Springer
16 years 16 hour ago
2008
Springer
Abstract. A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited, nonreplenishable battery charge. The batte...
179
click to vote
ROBOCOMM
2007
IEEE
15 years 12 months ago
2007
IEEE
—For the first time, the problem of optimizing energy for communication and motion is investigated. We consider a single mobile robot with continuous high bandwidth wireless com...
148
click to vote
COCO
2007
Springer
15 years 12 months ago
2007
Springer
The NP machine hypothesis posits the existence of an ǫ > 0 and a nondeterministic polynomial-time Turing machine M which accepts the language 0∗ but for which no determinist...
145
click to vote
ICDM
2005
IEEE
15 years 11 months ago
2005
IEEE
Data mining algorithms are facing the challenge to deal with an increasing number of complex objects. For graph data, a whole toolbox of data mining algorithms becomes available b...