245 search results - page 26 / 49 » Group connectivity of graphs with diameter at most 2 |
103
click to vote
ICDCS
2002
IEEE
15 years 2 months ago
2002
IEEE
Abstract—We propose a new geometric spanner for wireless ad hoc networks, which can be constructed efficiently in a distributed manner. It integrates the connected dominating se...
WG
1998
Springer
15 years 2 months ago
1998
Springer
In this work we introduce the class of graphs with bounded induced distance of order k, (BID(k) for short). A graph G belongs to BID(k) if the distance between any two nodes in ev...
DISOPT
2008
14 years 9 months ago
2008
We define the k-path tree matroid, and use it to solve network design problems in which the required connectivity is arbitrary for a given pair of nodes, and 1 for the other pairs...
DMGT
2011
14 years 1 months ago
2011
The Traveling Salesman Problem (TSP) is still one of the most researched topics in computational mathematics, and we introduce a variant of it, namely the study of the closed k-wa...
106
click to vote
DAM
2002
14 years 9 months ago
2002
We define the decision problem data arrangement, which involves arranging the vertices of a graph G at the leaves of a d-ary tree so that a weighted sum of the distances between p...