4865 search results - page 199 / 973 » The Complexity of Graph Connectivity |
133
Voted
ICML
2005
IEEE
16 years 4 months ago
2005
IEEE
We apply classic online learning techniques similar to the perceptron algorithm to the problem of learning a function defined on a graph. The benefit of our approach includes simp...
113
Voted
EJC
2007
15 years 3 months ago
2007
Let G be a nonsingular connected mixed graph. We determine the mixed graphs G on at least seven vertices with exactly two Laplacian eigenvalues greater than 2. In addition, all mi...
128
Voted
LAWEB
2006
IEEE
15 years 9 months ago
2006
IEEE
In this paper we study duplicates on the Web, using collections containing documents of all sites under the .cl domain that represent accurate and representative subsets of the We...
147
Voted
DMTCS
2010
15 years 1 months ago
2010
Motivated by the bijection between Schnyder labelings of a plane triangulation and partitions of its inner edges into three trees, we look for binary labelings for quadrangulation...
136
Voted
CCCG
2008
15 years 5 months ago
2008
Local route discovery in geometric, strongly connected, undirected plane graphs is guaranteed by the Face Routing algorithm. The algorithm is local and geometric in the sense that...