684 search results - page 9 / 137 » On embedding well-separable graphs |
107
click to vote
CVPR
2012
IEEE
13 years 2 days ago
2012
IEEE
Mode-seeking has been widely used as a powerful data analysis technique for clustering and filtering in a metric feature space. We introduce a versatile and efficient modeseekin...
CIE
2008
Springer
14 years 11 months ago
2008
Springer
A computable graph is computably categorical if any two computable presentations of the graph are computably isomorphic. In this paper we investigate the class of computably catego...
GD
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present a fast spectral graph drawing algorithm for drawing undirected connected graphs. Classical Multi-Dimensional Scaling yields a quadratictime spectral algorithm,...
101
click to vote
JCT
2008
14 years 9 months ago
2008
ABSTRACT. In this paper we give a lower bound for the least distortion embedding of a distance regular graph into Euclidean space. We use the lower bound for finding the least dist...
90
Voted
CORR
2002
Springer
14 years 9 months ago
2002
Springer
Traditional representations of graphs and their duals suggest the requirement that the dual vertices should be placed inside their corresponding primal faces, and the edges of the ...