376 search results - page 3 / 76 » Completely connected clustered graphs |
SCN
2008
Springer
14 years 9 months ago
2008
Springer
In this work we study linear secret sharing schemes for s-t connectivity in directed graphs. In such schemes the parties are edges of a complete directed graph, and a set of partie...
67
Voted
PRL
1998
14 years 9 months ago
1998
In this paper we propose an encoding scheme and ad hoc operators for a genetic approach to hierarchical graph clustering. Given a connected graph whose vertices correspond to poin...
CLUSTER
2000
IEEE
15 years 1 months ago
2000
IEEE
To construct a large commodity clustec a hierarchical network is generally adopted for connecting the host muchines, where a Gigabit backbone switch connects a few commodity switc...
94
Voted
STOC
2010
ACM
15 years 2 months ago
2010
ACM
We give the first polynomial-time approximation scheme (PTAS) for the Steiner forest problem on planar graphs and, more generally, on graphs of bounded genus. As a first step, w...
ENDM
2007
14 years 9 months ago
2007
For any finite abelian group G and any subset S ⊆ G, we determine the connectivity of the addition Cayley graph induced by S on G. Moreover, we show that if this graph is not c...