Sciweavers

691 search results - page 18 / 139
» Non-negative graph embedding
Sort
View
COMPGEOM
2006
ACM
14 years 1 months ago
Plane embeddings of planar graph metrics
Embedding metrics into constant-dimensional geometric spaces, such as the Euclidean plane, is relatively poorly understood. Motivated by applications in visualization, ad-hoc netw...
MohammadHossein Bateni, Mohammad Taghi Hajiaghayi,...
NIPS
2003
13 years 9 months ago
Minimax Embeddings
Spectral methods for nonlinear dimensionality reduction (NLDR) impose a neighborhood graph on point data and compute eigenfunctions of a quadratic form generated from the graph. W...
Matthew Brand
DM
2007
103views more  DM 2007»
13 years 7 months ago
Minimum cycle bases of graphs on surfaces
In this paper we study the cycle base structures of embedded graphs on surfaces. We first give a sufficient and necessary condition for a set of facial cycles to be contained in ...
Han Ren, Mo Deng
CORR
2008
Springer
147views Education» more  CORR 2008»
13 years 8 months ago
C-K-R Partitions of Sparse Graphs
We present fast algorithms for constructing probabilistic embeddings and approximate distance oracles in sparse graphs. The main ingredient is a fast algorithm for sampling the pr...
Manor Mendel, Chaya Schwob
DCG
2010
135views more  DCG 2010»
13 years 8 months ago
Universal Sets of n Points for One-bend Drawings of Planar Graphs with n Vertices
This paper shows that any planar graph with n vertices can be point-set embedded with at most one bend per edge on a universal set of n points in the plane. An implication of this...
Hazel Everett, Sylvain Lazard, Giuseppe Liotta, St...