712 search results - page 37 / 143 » On Spectral Graph Drawing |
GC
2010
Springer
15 years 24 days ago
2010
Springer
IPL
2010
15 years 22 days ago
2010
98
Voted
TCS
2010
15 years 19 days ago
2010
139
click to vote
JCT
2007
15 years 2 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...
116
click to vote
SDM
2007
SIAM
15 years 3 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...