446 search results - page 37 / 90 » A fast algorithm for computing steiner edge connectivity |
DM
2007
14 years 9 months ago
2007
We present an algorithm that determines the prime factors of connected graphs with respect to the Cartesian product in linear time and space. This improves a result of Aurenhammee...
94
Voted
SI3D
2009
ACM
15 years 4 months ago
2009
ACM
We introduce a straightforward, robust, and efficient algorithm for rendering high-quality soft shadows in dynamic scenes. Each frame, points in the scene visible from the eye ar...
119
Voted
GD
1998
Springer
15 years 1 months ago
1998
Springer
We demonstrate the H3Viewer graph drawing library, which can be run from a standalone program or in conjunction with other programs such as SGI's Site Manager application. Our...
ICPR
2000
IEEE
15 years 10 months ago
2000
IEEE
In order to process video data efficiently, a video segmentation technique through scene change detection must be employed. Many of advanced video applications require manipulatio...
KDD
2007
ACM
15 years 10 months ago
2007
ACM
Network clustering (or graph partitioning) is an important task for the discovery of underlying structures in networks. Many algorithms find clusters by maximizing the number of i...