365 search results - page 58 / 73 » On the Crossing Spanning Tree Problem |
GD
2005
Springer
14 years 1 months ago
2005
Springer
A clustered graph has its vertices grouped into clusters in a hierarchical way via subset inclusion, thereby imposing a tree structure on the clustering relationship. The c-planari...
IPPS
2005
IEEE
14 years 1 months ago
2005
IEEE
We present an experimental study of parallel biconnected components algorithms employing several fundamental parallel primitives, e.g., prefix sum, list ranking, sorting, connect...
MOBIHOC
2002
ACM
14 years 7 months ago
2002
ACM
A connected dominating set (CDS) for a graph G(V, E) is a subset V of V , such that each node in V - V is adjacent to some node in V , and V induces a connected subgraph. A CDS ha...
IPPS
2010
IEEE
13 years 5 months ago
2010
IEEE
We investigate the problem of maintaining a topology with small degree as well as small diameter in a dynamic distributed system such that the system always stays connected and pr...
FOCS
2006
IEEE
14 years 1 months ago
2006
IEEE
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...