352 search results - page 51 / 71 » Partitioning Graphs into Connected Parts |
CORR
2011
Springer
14 years 3 months ago
2011
Springer
This paper considers the problem of clustering a partially observed unweighted graph – i.e. one where for some node pairs we know there is an edge between them, for some others ...
134
Voted
MASS
2010
14 years 9 months ago
2010
Delay tolerant networks (DTNs) are a special type of wireless mobile networks which may lack continuous network connectivity. Multicast is an important routing function that suppor...
ICALP
1992
Springer
15 years 3 months ago
1992
Springer
Suppose that n tokens are arbitrarily placed on the n nodes of a graph. At each parallel step one token may be moved from each node to an adjacent node. An algorithm for the near-...
ICRA
2009
IEEE
15 years 6 months ago
2009
IEEE
— Shape is one of the useful information for object detection. The human visual system can often recognize objects based on the 2-D outline shape alone. In this paper, we address...
INFOCOM
2009
IEEE
15 years 6 months ago
2009
IEEE
—Communication networks are vulnerable to natural disasters, such as earthquakes or floods, as well as to physical attacks, such as an Electromagnetic Pulse (EMP) attack. Such r...