Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

91

Voted

CCCG
2001

77views Computational Geometry» more CCCG 2001»

Good approximations for the relative neighbourhood graph

15 years 4 months ago

Good approximations for the relative neighbourhood graph

Download www.tecgraf.puc-rio.br

Diogo Vieira Andrade, Luiz Henrique de Figueiredo

Real-time Traffic

CCCG 2001 | CCCG 2007 |

claim paper

Related Content

» HyperANF Approximating the Neighbourhood Function of Very Large Graphs on a Budget

» On the Complexity of Approximating TSP with Neighborhoods and Related Problems

» Local Clustering of Large Graphs by Approximate Fiedler Vectors

» Approximate Shortest Paths Guided by a Small Index

» Fast Random Walk with Restart and Its Applications

» ShockBased Indexing into Large Shape Databases

» Empirical comparison of algorithms for network community detection

» A Statistical Model for General Contextual Object Recognition

» A DoubleLoop Algorithm to Minimize the Bethe Free Energy

Post Info
More Details (n/a)

Added	31 Oct 2010
Updated	31 Oct 2010
Type	Conference
Year	2001
Where	CCCG
Authors	Diogo Vieira Andrade, Luiz Henrique de Figueiredo

Comments (0)