3757 search results - page 484 / 752 » The overlap number of a graph |
181
click to vote
SPAA
2006
ACM
16 years 17 days ago
2006
ACM
We initiate the study of semi-oblivious routing, a relaxation of oblivious routing which is first introduced by R¨acke and led to many subsequent improvements and applications. ...
160
click to vote
CORR
2010
Springer
15 years 5 months ago
2010
Springer
We consider an extension of the popular matching problem in this paper. The input to the popular matching problem is a bipartite graph G = (A ∪ B, E), where A is a set of people,...
184
click to vote
TCOM
2010
15 years 5 months ago
2010
Abstract— Today, due to the vast amount of literature on largescale wireless networks, we have a fair understanding of the asymptotic behavior of such networks. However, in real ...
205
click to vote
IPPS
2010
IEEE
15 years 3 months ago
2010
IEEE
Abstract--Ensuring the correctness of complex implementations of software transactional memory (STM) is a daunting task. Attempts have been made to formally verify STMs, but these ...
204
click to vote
CORR
2011
Springer
14 years 10 months ago
2011
Springer
A hitting set for a collection of sets is a set that has a nonempty intersection with each set in the collection; the hitting set problem is to find a hitting set of minimum card...