239 search results - page 36 / 48 » Hardness and algorithms for rainbow connection |
EDBT
2009
ACM
15 years 4 months ago
2009
ACM
We consider a near future scenario in which users of a Web 2.0 application, such as a social network, contribute to the application not only data, but also rules which automatical...
108
click to vote
ICS
2010
Tsinghua U.
15 years 3 months ago
2010
Tsinghua U.
: We study the weight distribution and list-decoding size of Reed-Muller codes. Given a weight parameter, we are interested in bounding the number of Reed-Muller codewords with a w...
102
click to vote
STOC
2006
ACM
16 years 12 hour ago
2006
ACM
We study the maximum edge-disjoint paths problem in undirected planar graphs: given a graph G and node pairs s1t1, s2t2, . . ., sktk, the goal is to maximize the number of pairs t...
MOBIHOC
2008
ACM
15 years 11 months ago
2008
ACM
Mobile opportunistic networks are characterized by unpredictable mobility, heterogeneity of contact rates and lack of global information. Successful delivery of messages at low co...
119
click to vote
PLDI
2004
ACM
15 years 5 months ago
2004
ACM
This paper presents the first scalable context-sensitive, inclusionbased pointer alias analysis for Java programs. Our approach to context sensitivity is to create a clone of a m...