49 search results - page 9 / 10 » New Sparseness Results on Graph Spanners |
168
click to vote
WWW
2008
ACM
16 years 7 months ago
2008
ACM
A large body of work has been devoted to identifying community structure in networks. A community is often though of as a set of nodes that has more connections between its member...
198
click to vote
PRL
2010
15 years 5 months ago
2010
: Single training image face recognition is one of main challenges to appearance-based pattern recognition techniques. Many classical dimensionality reduction methods such as LDA h...
164
click to vote
WEA
2005
Springer
16 years 3 days ago
2005
Springer
Abstract. In this paper we consider the problem of computing a minimum cycle basis of an undirected graph G = (V, E) with n vertices and m edges. We describe an efficient implement...
136
click to vote
SIAMDM
2010
15 years 5 months ago
2010
For a graph G = (V, E) we consider vertex-k-labellings f : V → {1, 2, . . . , k} for which the induced edge weighting w : E → {2, 3, . . . , 2k} with w(uv) = f(u) + f(v) is inj...
173
click to vote
SIGIR
2005
ACM
16 years 5 days ago
2005
ACM
Link analysis algorithms have been extensively used in Web information retrieval. However, current link analysis algorithms generally work on a flat link graph, ignoring the hiera...