2137 search results - page 131 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
167
click to vote
GG
2004
Springer
15 years 10 months ago
2004
Springer
Abstract. In the context of graph transformation we look at the operation of switching, which can be viewed as an elegant method for realizing global transformations of (group-labe...
175
Voted
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—In this paper we consider the problem of maximizing wireless network capacity (a.k.a. one-shot scheduling) in both the protocol and physical models. We give the first distribut...
175
Voted
CIKM
2007
Springer
15 years 9 months ago
2007
Springer
We investigate the problem of how to evaluate, fast and efficiently, classes of optimal route queries on a massive graph in a unified framework. To evaluate a route query effectiv...
171
Voted
WINE
2007
Springer
15 years 11 months ago
2007
Springer
A context in sponsored search is additional information about a query, such as the user’s age, gender or location, that can change an advertisement’s relevance or an advertise...
150
Voted
CSE
2009
IEEE
15 years 2 months ago
2009
IEEE
Edges in social network graphs can model sensitive relationships. In this paper, we consider the problem of edges anonymity in graphs. We propose a probabilistic notion of edge ano...