684 search results - page 66 / 137 » On embedding well-separable graphs |
137
click to vote
FOCS
2009
IEEE
15 years 11 months ago
2009
IEEE
— We show that for every fixed k, there is a linear time algorithm that decides whether or not a given graph has a vertex set X of order at most k such that G − X is planar (w...
161
click to vote
IJCAI
2003
15 years 5 months ago
2003
We equate nonlinear dimensionality reduction (NLDR) to graph embedding with side information about the vertices, and derive a solution to either problem in the form of a kernel-ba...
156
click to vote
CORR
2011
Springer
14 years 7 months ago
2011
Springer
This article investigates selfish behavior in games where players are embedded in a social context. A framework is presented which allows us to measure the Windfall of Friendship...
121
click to vote
ICASSP
2008
IEEE
15 years 10 months ago
2008
IEEE
In the symbol recognition stage of online handwritten math expression recognition, the one-pass dynamic programming algorithm can produce high-quality symbol graphs in addition of...
139
click to vote
IJCNN
2007
IEEE
15 years 10 months ago
2007
IEEE
—A new interactive visualization tool is proposed for textual data mining based on bipartite graph visualization. Applications to three text datasets are presented to show the ca...