Distance functions on random geometric graphs uniform density. If we build an unweighted kNN graph based on this data and apply Isomap to recover the point configuration, we get the figure on the right. Obviously, it is

First Page		Document Content
Date: 2012-12-21 09:36:16 Graph Shortest path problem Distance Median graph Graph theory Mathematics Theoretical computer science		Distance functions on random geometric graphs uniform density. If we build an unweighted kNN graph based on this data and apply Isomap to recover the point configuration, we get the figure on the right. Obviously, it is Add to Reading List Source URL: www.is.tuebingen.mpg.de Download Document from Source Website File Size: 523,96 KB Share Document on Facebook