352 search results - page 41 / 71 » Partitioning Graphs into Connected Parts |
190
click to vote
EUROSYS
2011
ACM
14 years 7 months ago
2011
ACM
Mobile applications are becoming increasingly ubiquitous and provide ever richer functionality on mobile devices. At the same time, such devices often enjoy strong connectivity wi...
128
click to vote
ICCSA
2004
Springer
15 years 9 months ago
2004
Springer
We propose a hierarchical, cluster based semi-distributed routing protocol for a mobile ad hoc network. The network graph is partitioned into clusters using heuristics and the shor...
117
click to vote
DAGSTUHL
2007
15 years 5 months ago
2007
Automated political districting shares with electronic voting the aim of preventing electoral manipulation and pursuing an impartial electoral mechanism. Political districting can...
147
click to vote
HIS
2009
15 years 1 months ago
2009
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
136
click to vote
FOCS
2008
IEEE
15 years 10 months ago
2008
IEEE
We study the k-wise independent relaxation of the usual model G(N, p) of random graphs where, as in this model, N labeled vertices are fixed and each edge is drawn with probabili...