9572 search results - page 32 / 1915 » Cover Algorithms and Their Combination |
WWW
2006
ACM
14 years 8 months ago
2006
ACM
We consider the problem of visualizing the evolution of tags within the Flickr (flickr.com) online image sharing community. Any user of the Flickr service may append a tag to any ...
APPROX
2000
Springer
13 years 12 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
SODA
2003
ACM
13 years 9 months ago
2003
ACM
We study the cover time of a random walk on graphs G ∈ Gn,p when p = c log n
STACS
2005
Springer
14 years 1 months ago
2005
Springer
Cycle covering is a well-studied problem in computer science. In this paper, we develop approximation algorithms for variants of cycle covering problems which bound the size and/o...
APPROX
2007
Springer
14 years 1 months ago
2007
Springer
We study the cover time of a random walk on the random digraph Dn,p when np =