2031 search results - page 365 / 407 » On Tree-Constrained Matchings and Generalizations |
COMPGEOM
2010
ACM
14 years 3 months ago
2010
ACM
Let D be a weighted directed graph cellularly embedded in a surface of genus g, orientable or not, possibly with boundary. We describe algorithms to compute a shortest non-contrac...
STOC
2010
ACM
14 years 2 months ago
2010
ACM
Revisiting the “small-world” experiments of the ’60s, Kleinberg observed that individuals are very effective at constructing short chains of acquaintances between any two p...
SIGECOM
2010
ACM
14 years 2 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
SIGMETRICS
2010
ACM
14 years 2 months ago
2010
ACM
In this paper, we study distributed channel assignment in wireless networks with applications to peer discovery in ad hoc wireless networks. We model channel assignment as a color...
CIKM
2009
Springer
14 years 2 months ago
2009
Springer
Traditional desktop search engines only support keyword based search that needs exact keyword matching to find resources. However, users generally have a vague picture of what is...