712 search results - page 37 / 143 » On Spectral Graph Drawing |
GC
2010
Springer
13 years 6 months ago
2010
Springer
IPL
2010
13 years 6 months ago
2010
TCS
2010
13 years 6 months ago
2010
JCT
2007
13 years 7 months ago
2007
We give a new upper bound for the rectilinear crossing number cr(n) of the complete geometric graph Kn. We prove that cr(n) ≤ 0.380559 ¡n 4 ¢ + Θ(n3 ) by means of a new const...
SDM
2007
SIAM
13 years 9 months ago
2007
SIAM
In this paper we formulate spectral clustering in directed graphs as an optimization problem, the objective being a weighted cut in the directed graph. This objective extends seve...