Back to Results
First PageMeta Content
Finite fields / Computational geometry / Matroid theory / Tutte polynomial / Factorization of polynomials over a finite field and irreducibility tests / Mathematics / Polynomials / Elliptic curves


Approximating the average stretch factor of geometric graphs∗ Siu-Wing Cheng† Christian Knauer‡ Stefan Langerman§ Michiel Smid¶ Abstract Let G be a geometric graph whose vertex set S is a set of n points in Rd .
Add to Reading List

Document Date: 2011-01-03 00:53:54

Open Document

File Size: 183,90 KB

Share Result on Facebook

City

HKUST / Bruxelles / /

Company

G. / R. / /

Country

China / /

Currency

pence / /

Facility

Carleton University / Institute of Computer Science / /

IndustryTerm

road network / approximation algorithm / binary search / binary search trees / balanced binary search tree / present algorithms / above divide-and-conquer algorithm / computing / above algorithm / shortest-path algorithm / /

Organization

School of Computer Science / Carleton University / Ottawa / Research Grant Council / Department of Computer Science and Engineering / Institute of Computer Science / /

Person

Siu-Wing Cheng / Abi / Stefan Langerman§ Michiel Smid / Christian Knauer‡ Stefan Langerman / Ai / Ari / /

Position

Prime Minister / /

Product

Pentax K-x Digital Camera / /

ProgrammingLanguage

D / /

RadioStation

WSPD 2 / WSPD / /

Technology

above algorithm / following algorithm / approximation algorithm / also present algorithms / shortest-path algorithm / same algorithm / above divide-and-conquer algorithm / /

SocialTag