1321 search results - page 5 / 265 » Quadratic forms on graphs |
MP
2010
14 years 10 months ago
2010
GD
2007
Springer
15 years 5 months ago
2007
Springer
Abstract. Constrained stress majorization is a promising new technique for integrating application specific layout constraints into forcedirected graph layout. We significantly i...
WG
2007
Springer
15 years 5 months ago
2007
Springer
In the Planar +k vertex problem the task is to find at most k vertices whose deletion makes the given graph planar. The graphs for which there exists a solution form a minor close...
101
click to vote
NIPS
2003
15 years 1 months ago
2003
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...
102
Voted
STOC
2001
ACM
16 years 18 hour ago
2001
ACM
We show that for every fixed ? there is a quadratic time algorithm that decides whether a given graph has crossing number at most and, if this is the case, computes a drawing of t...