712 search results - page 69 / 143 » On Spectral Graph Drawing |
146
click to vote
GD
1999
Springer
15 years 11 months ago
1999
Springer
In this paper we present a novel approach for cluster-based drawing of large planar graphs that maintains planarity. Our technique works for arbitrary planar graphs and produces a ...
155
click to vote
SDM
2009
SIAM
16 years 3 months ago
2009
SIAM
Social networks tend to contain some amount of randomness and some amount of non-randomness. The amount of randomness versus non-randomness affects the properties of a social netw...
180
click to vote
FOCS
2000
IEEE
15 years 11 months ago
2000
IEEE
We motivate and develop a natural bicriteria measure for assessing the quality of a clustering that avoids the drawbacks of existing measures. A simple recursive heuristic is shown...
166
click to vote
GBRPR
2005
Springer
16 years 1 days ago
2005
Springer
In this paper we explore how a spectral technique suggested by quantum walks can be used to distinguish non-isomorphic cospectral graphs. Reviewing ideas from the field of quantum...
169
click to vote
IEICET
2010
15 years 5 months ago
2010
Traditionally, popular synonym acquisition methods are based on the distributional hypothesis, and a metric such as Jaccard coefficients is used to evaluate the similarity between...