<--- Back to Details
First PageDocument Content
David Eppstein / Discrete geometry / Computational geometry / Voronoi diagram / Eppstein / Cubic graph / Graph theory / Mathematics / Geometry
Date: 2013-04-13 23:53:24
David Eppstein
Discrete geometry
Computational geometry
Voronoi diagram
Eppstein
Cubic graph
Graph theory
Mathematics
Geometry

Add to Reading List

Source URL: www.ics.uci.edu

Download Document from Source Website

File Size: 167,70 KB

Share Document on Facebook

Similar Documents

Young Researcher Forum ‣ Rodrigo Silveira (chair) ‣ Benjamin Burton ‣ David Eppstein ‣ Matthew Katz ‣ Matias Korman

DocID: 1uliw - View Document

Graph theory / Mathematics / Network theory / Routing algorithms / Edsger W. Dijkstra / Spanning tree / Bipartite graphs / Shortest path problem / Tree / Graph / Geographic routing / Routing

Category-Based Routing in Social Networks: Membership Dimension and the Small-World Phenomenon David Eppstein∗ arXiv:1108.4675v1 [cs.SI] 23 Aug 2011

DocID: 1rg13 - View Document

Mathematics / Statistics / Applied mathematics / Data mining / Search algorithms / Approximation algorithms / Discrete geometry / Nearest neighbor search / Numerical analysis / Hierarchical clustering / Cluster analysis / K-means clustering

Fast Hierarchical Clustering and Other Applications of Dynamic Closest Pairs David Eppstein∗ Abstract dynamic closest pair problem. It can be solved by brute force 2 We develop data structures for dynamic closest pair

DocID: 1rdUy - View Document

Mathematics / Geometry / Computer science / Search algorithms / Discrete geometry / Computational geometry / Mathematical optimization / Closest pair of points problem / Nearest neighbor search / Nearest neighbor graph / K-nearest neighbors algorithm / Euclidean minimum spanning tree

Dynamic Euclidean Minimum Spanning Trees and Extrema of Binary Functions David Eppstein Department of Information and Computer Science University of California, Irvine, CA 92717

DocID: 1qXBI - View Document

NP-complete problems / Theoretical computer science / Analysis of algorithms / Parameterized complexity / Independent set / Algorithm / Kernelization / Book:Graph Theory / Book:Graph Algorithms

Colloquium Department of Computer Science Dr. Darren Strash Darren graduated in 2011 with a PhD in Computer Science from University of California, Irvine, with Mike Goodrich and David Eppstein as advisors. After graduati

DocID: 1p6k0 - View Document