174 search results - page 20 / 35 » Connected dominating sets on dynamic geometric graphs |
161
click to vote
SODA
2007
ACM
15 years 7 months ago
2007
ACM
Random geometric graphs have been one of the fundamental models for reasoning about wireless networks: one places n points at random in a region of the plane (typically a square o...
252
click to vote
IWPEC
2010
Springer
15 years 4 months ago
2010
Springer
The Colorful Motif problem asks if, given a vertex-colored graph G, there exists a subset S of vertices of G such that the graph induced by G on S is connected and contains every c...
181
click to vote
IFM
2009
Springer
15 years 3 months ago
2009
Springer
Abstract. A communication system evolves dynamically with the addition and deletion of services. In our previous work [12], a graph transformation system (GTS) was used to model th...
158
click to vote
EOR
2008
15 years 6 months ago
2008
Multicut is a fundamental network communication and connectivity problem. It is defined as: given an undirected graph and a collection of pairs of terminal vertices, find a minimu...
220
click to vote
BROADNETS
2005
IEEE
15 years 11 months ago
2005
IEEE
—In this paper, we present an extended Mobile Backbone Network (MBN) topology synthesis algorithm (ETSA) for constructing and maintaining a dynamic backbone structure in mobile w...