245 search results - page 25 / 49 » Group connectivity of graphs with diameter at most 2 |
SODA
2003
ACM
13 years 9 months ago
2003
ACM
The natural relaxation for the Group Steiner Tree problem, as well as for its generalization, the Directed Steiner Tree problem, is a flow-based linear programming relaxation. We...
APPT
2007
Springer
14 years 1 months ago
2007
Springer
We investigate the problem of constructing the maximal number of node disjoint paths between two distinct nodes in Swapped/OTIS networks. A general construction of node disjoint pa...
AINA
2009
IEEE
14 years 2 months ago
2009
IEEE
—Topology control in a wireless sensor network is useful for ensuring that the network remains connected in the presence of nodes that exhaust their energy or become altogether d...
WSDM
2012
ACM
12 years 3 months ago
2012
ACM
We study the problem of correlating micro-blogging activity with stock-market events, defined as changes in the price and traded volume of stocks. Specifically, we collect messa...
JCO
2007
13 years 7 months ago
2007
In a graph G, a vertex dominates itself and its neighbors. A subset S ⊆ V (G) is an m-tuple dominating set if S dominates every vertex of G at least m times, and an m-dominating...