77 search results - page 10 / 16 » Robust Subgraphs for Trees and Paths |
SODA
2012
ACM
11 years 9 months ago
2012
ACM
Given a class of graphs F, we say that a graph G is universal for F, or F-universal, if every H ∈ F is contained in G as a subgraph. The construction of sparse universal graphs ...
INFOCOM
1999
IEEE
13 years 11 months ago
1999
IEEE
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
116
click to vote
Publication
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is
selected aut...
112
click to vote
Presentation
In this paper, we present a novel framework for computing centerlines for both 2D and 3D shape analysis. The framework works as follows: an object centerline point is selected auto...
INFOCOM
2007
IEEE
14 years 1 months ago
2007
IEEE
— Group communications are important in Mobile Ad hoc Networks (MANET). Multicast is an efficient method to implement the group communications. However, it is challenging to imp...