446 search results - page 13 / 90 » A fast algorithm for computing steiner edge connectivity |
KDD
2004
ACM
15 years 10 months ago
2004
ACM
We define a connection subgraph as a small subgraph of a large graph that best captures the relationship between two nodes. The primary motivation for this work is to provide a pa...
SODA
2003
ACM
14 years 11 months ago
2003
ACM
Motivated by routing issues in ad hoc networks, we present polylogarithmic-time distributed algorithms for two problems. Given a network, we first show how to compute connected a...
CATA
2000
14 years 11 months ago
2000
We investigate a method to speed up the O(n3 ) labeling algorithm of Rosenfeld and Pfaltz for segmenting binary images, which is unduly complex for large images. That algorithm sea...
PG
2007
IEEE
15 years 3 months ago
2007
IEEE
A new geometry-based finite difference method for a fast and reliable detection of perceptually salient curvature extrema on surfaces approximated by dense triangle meshes is pro...
106
click to vote
FOCS
2008
IEEE
15 years 4 months ago
2008
IEEE
Dynamic connectivity is a well-studied problem, but so far the most compelling progress has been confined to the edge-update model: maintain an understanding of connectivity in a...