239 search results - page 21 / 48 » Hardness and algorithms for rainbow connection |
COCO
2009
Springer
15 years 6 months ago
2009
Springer
Graph Isomorphism is the prime example of a computational problem with a wide difference between the best known lower and upper bounds on its complexity. There is a significant ...
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— Power efficient operation is very critical in energy constrained multi-hop wireless networks. One important technique is to intelligently assign transmission powers to nodes w...
118
click to vote
DIALM
2005
ACM
15 years 1 months ago
2005
ACM
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
167
click to vote
IWPEC
2010
Springer
14 years 9 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
111
click to vote
WSDM
2012
ACM
13 years 7 months ago
2012
ACM
We study the problem of correlating micro-blogging activity with stock-market events, defined as changes in the price and traded volume of stocks. Specifically, we collect messa...