3008 search results - page 221 / 602 » Independence in connected graphs |
168
click to vote
ESANN
2007
15 years 8 months ago
2007
Local algorithms for non-linear dimensionality reduction [1], [2], [3], [4], [5] and semi-supervised learning algorithms [6], [7] use spectral decomposition based on a nearest neig...
152
click to vote
ESANN
2003
15 years 8 months ago
2003
We propose the use of the Gabriel graph for the exploratory analysis of potentially high dimensional labeled data. Gabriel graph is a subgraph of the Delaunay triangulation, which ...
162
click to vote
APPML
2007
15 years 6 months ago
2007
-An edge of a graph H with a perfect matching is a fixed edge if it either belongs to none or to all of the perfect matchings of H. It is shown that a connected plane bipartite gra...
175
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
Given an n-vertex graph G, a drawing of G in the plane is a mapping of its vertices into points of the plane, and its edges into continuous curves, connecting the images of their ...
151
click to vote
CORR
2010
Springer
15 years 6 months ago
2010
Springer
In an undirected graph G = (V, E), a subset C V such that C is a dominating set of G, and each vertex in V is dominated by a distinct subset of vertices from C, is called an iden...