1101 search results - page 144 / 221 » An Algorithm for the Graph Crossing Number Problem |
102
Voted
CORR
2010
Springer
15 years 1 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,...
111
Voted
STOC
2010
ACM
15 years 7 months ago
2010
ACM
Dynamic graph connectivity algorithms have been studied for many years, but typically in the most general possible setting, where the graph can evolve in completely arbitrary ways...
112
click to vote
SIGMOD
2010
ACM
15 years 7 months ago
2010
ACM
Serious concerns on privacy protection in social networks have been raised in recent years; however, research in this area is still in its infancy. The problem is challenging due ...
138
click to vote
ALMOB
2006
15 years 2 months ago
2006
Given a set S of n locally aligned sequences, it is a needed prerequisite to partition it into groups of very similar sequences to facilitate subsequent computations, such as the ...
119
click to vote
INFOCOM
2008
IEEE
15 years 9 months ago
2008
IEEE
Abstract—Latency reduction in distributed interactive applications has been studied intensively. Such applications may have stringent latency requirements and dynamic user groups...