2137 search results - page 311 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
121
click to vote
WG
2000
Springer
15 years 8 months ago
2000
Springer
: In a previous work, the authors introduced the class of graphs with bounded induced distance of order k, (BID(k) for short) to model non-reliable interconnection networks. A netw...
164
click to vote
IJWMC
2010
15 years 2 months ago
2010
Coverage, fault tolerance and power consumption constraints make optimal placement of mobile sensors or other mobile agents a hard problem. We have developed a model for describin...
133
Voted
STOC
2010
ACM
15 years 9 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...
157
Voted
ADHOC
2005
15 years 4 months ago
2005
Geographic routing protocols base their forwarding decisions on the location of the current device, its neighbors, and the packets destination. Early proposed heuristic greedy rou...
133
click to vote
KDD
2007
ACM
16 years 5 months ago
2007
ACM
In this paper we address the problem of detecting topics in large-scale linked document collections. Recently, topic detection has become a very active area of research due to its...