2137 search results - page 262 / 428 » Approximation Algorithms for Some Graph Partitioning Problem... |
180
click to vote
TCAD
2008
15 years 6 months ago
2008
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
152
click to vote
MOBIHOC
2008
ACM
16 years 5 months ago
2008
ACM
Local monitoring is an effective mechanism for the security of wireless sensor networks (WSNs). Existing schemes assume the existence of sufficient number of active nodes to carry...
277
click to vote
SIGMOD
2007
ACM
16 years 6 months ago
2007
ACM
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
162
click to vote
CSL
2010
Springer
15 years 7 months ago
2010
Springer
We consider two-player games with imperfect information and quantitative objective. The game is played on a weighted graph with a state space partitioned into classes of indistingu...
218
click to vote
TKDE
2012
13 years 8 months ago
2012
— This paper presents a method for identifying a set of dense subgraphs of a given sparse graph. Within the main applications of this “dense subgraph problem”, the dense subg...