352 search results - page 55 / 71 » Partitioning Graphs into Connected Parts |
101
click to vote
EJWCN
2010
14 years 6 months ago
2010
A Mobile Ad Hoc Network (MANET) is characterized by the lack of any infrastructure, absence of any kind of centralized administration, frequent mobility of nodes, network partitio...
ICIP
2009
IEEE
16 years 23 days ago
2009
IEEE
We propose a new fibre tracking algorithm for cardiac DTMRI that parts with the locally "greedy" paradigm intrinsic to conventional tracking algorithms. We formulate the...
IPPS
2003
IEEE
15 years 5 months ago
2003
IEEE
Kahn defined a formal model for networks of processes that communicate through channels carrying streams of data tokens. His mathematical results show the necessary conditions fo...
FOCS
1994
IEEE
15 years 3 months ago
1994
IEEE
We describe algorithms for finding the k shortest paths connecting a given pair of vertices in a digraph (allowing cycles). Our algorithms output an implicit representation of the...
112
click to vote
ALGORITHMICA
2002
14 years 11 months ago
2002
Let S be a set of n points in a metric space, and k a positive integer. Algorithms are given that construct k-fault-tolerant spanners for S. If in such a spanner at most k vertice...