5606 search results - page 163 / 1122 » Randomization Techniques for Graphs. |
147
click to vote
ESA
2007
Springer
15 years 6 months ago
2007
Springer
We present an experimental evaluation of an approximate distance oracle recently suggested by Thorup [1] for undirected planar graphs. The oracle uses the existence of graph separa...
105
click to vote
CORR
2010
Springer
15 years 22 days ago
2010
Springer
We give a simple polynomial-time algorithm to exactly count the number of Euler Tours (ETs) of any Eulerian generalized series-parallel graph, and show how to adapt this algorithm...
116
Voted
FAW
2009
Springer
15 years 7 months ago
2009
Springer
Data access time becomes the main bottleneck in applications dealing with large-scale graphs. Cache-oblivious layouts, constructed to minimize the geometric mean of arc lengths of ...
97
Voted
ICPR
2008
IEEE
15 years 7 months ago
2008
IEEE
Given a bipartite graph of collaborative ratings, the task of recommendation and rating prediction can be modeled with graph kernels. We interpret these graph kernels as the inver...
114
click to vote
STACS
2005
Springer
15 years 6 months ago
2005
Springer
Abstract. We consider the problem of computing a minimum cycle basis in a directed graph G with m arcs and n vertices. The arcs of G have non-negative weights assigned to them. We ...