An O(N1.5+ε) expected time algorithm for canonization and isomorphism testing of trivalent graphs

2005 ◽  
pp. 197-207
Author(s):  
Luděk Kučera
Keyword(s):  
Time Algorithm ◽  
Expected Time ◽  
Trivalent Graphs

A linear expected-time algorithm for computing planar relative neighbourhood graphs

1987 ◽  
Vol 25 (2) ◽  
pp. 77-86 ◽  
Author(s):  
Jyrki Katajainen ◽  
Olli Nevalainen ◽  
Jukka Teuhola
Keyword(s):  
Time Algorithm ◽  
Expected Time

A linear expected-time algorithm for deriving all logical conclusions implied by a set of boolean inequalities

1986 ◽  
Vol 34 (2) ◽  
pp. 223-231 ◽  
Author(s):  
Pierre Hansen ◽  
Brigitte Jaumard ◽  
Michel Minoux
Keyword(s):  
Time Algorithm ◽  
Expected Time

scholarly journals APPROXIMATE WEIGHTED FARTHEST NEIGHBORS AND MINIMUM DILATION STARS

2010 ◽  
Vol 02 (04) ◽  
pp. 553-565
Author(s):  
JOHN AUGUSTINE ◽  
DAVID EPPSTEIN ◽  
KEVIN A. WORTMAN
Keyword(s):  
Euclidean Space ◽  
Metric Space ◽  
Time Algorithm ◽  
Dimensional Euclidean Space ◽  
Star Topology ◽  
Expected Time ◽  
Efficient Reduction ◽  
Core Sets ◽  
Minimum Dilation ◽  
Set Of Points

We provide an efficient reduction from the problem of querying approximate multiplicatively weighted farthest neighbors in a metric space to the unweighted problem. Combining our techniques with core-sets for approximate unweighted farthest neighbors, we show how to find approximate farthest neighbors that are farther than a factor (1 - ∊) of optimal in time O( log n) per query in D-dimensional Euclidean space for any constants D and ∊. As an application, we find an O(n log n) expected time algorithm for choosing the center of a star topology network connecting a given set of points, so as to approximately minimize the maximum dilation between any pair of points.

Sign in / Sign up

Export Citation Format

Share Document