Sciweavers

4302 search results - page 10 / 861
» Index Pairs Algorithms
Sort
View
IPL
2006
105views more  IPL 2006»
14 years 9 months ago
A new approximation algorithm for labeling points with circle pairs
We study the NP-hard problem of labeling points with maximum-radius circle pairs: given n point sites in the plane, find a placement for 2n interior-disjoint uniform circles, such...
Minghui Jiang
72
Voted
IWOCA
2009
Springer
104views Algorithms» more  IWOCA 2009»
15 years 4 months ago
An O(n)-Time Algorithm for the Paired-Domination Problem on Permutation Graphs
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
Evaggelos Lappas, Stavros D. Nikolopoulos, Leonida...
55
Voted
ESA
1995
Springer
102views Algorithms» more  ESA 1995»
15 years 1 months ago
On the All-Pairs Shortest Path Algorithm of Moffat and Takaoka
Kurt Mehlhorn, Volker Priebe
53
Voted
SODA
2004
ACM
76views Algorithms» more  SODA 2004»
14 years 11 months ago
Experimental analysis of dynamic all pairs shortest path algorithms
Camil Demetrescu, Stefano Emiliozzi, Giuseppe F. I...
ICIP
1999
IEEE
15 years 11 months ago
Quadtrees for Embedded Surface Visualization: Constraints and Efficient Data Structures
The quadtree data structure is widely used in digital image processing and computer graphics for modeling spatial segmentation of images and surfaces. A quadtree is a tree in whic...
Laurent Balmelli, Jelena Kovacevic, Martin Vetterl...