3471 search results - page 224 / 695 » Obstacle Numbers of Graphs |
141
click to vote
ESANN
2007
15 years 6 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...
153
click to vote
DAGSTUHL
2006
15 years 6 months ago
2006
In this report paper we collect recent results on the vertex reconstruction in Cayley graphs Cay(G, S). The problem is stated as the problem of reconstructing a vertex from the mi...
143
click to vote
FLAIRS
2004
15 years 6 months ago
2004
ABSURDIST II, an extension to ABSURDIST, is an algorithm using attributed graph matching to find translations between conceptual systems. It uses information about the internal st...
143
click to vote
ARSCOM
2007
15 years 5 months ago
2007
Let G be a simple graph and f : V (G) → {1, 3, 5, ...} an odd integer valued function defined on V (G). A spanning subgraph F of G is called a (1, f)odd factor if dF (v) ∈ {1...
140
Voted
CORR
2010
Springer
15 years 5 months ago
2010
Springer
A local algorithm is a distributed algorithm that completes after a constant number of synchronous communication rounds. We present local approximation algorithms for the minimum ...